On the public citation graph

Infinite time Turing machines

0 signed · 252 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/978-3-662-12013-2openalex-snapshot
Higher Recursion Theory
inferredcites →https://doi.org/10.1007/bf00682813openalex-snapshot
Does general relativity allow an observer to view an eternity in a finite time?
inferredcites →https://doi.org/10.1017/9781316717196.005openalex-snapshot
Admissible Set Theory
inferredcites →https://doi.org/10.1017/9781316717301openalex-snapshot
Higher Recursion Theory
inferredcites →https://doi.org/10.1086/289716openalex-snapshot
Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes
inferredcites →https://doi.org/10.1086/psaprocbienmeetp.1994.1.193018openalex-snapshot
Non-Turing Computers and Non-Turing Computability
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/surv/155openalex-snapshot
Descriptive Set Theory
inferredcites →https://doi.org/10.1093/analys/15.1.1openalex-snapshot
Tasks and Super-Tasks
inferredcites →https://doi.org/10.1093/oso/9780195095913.001.0001openalex-snapshot
Bangs, Crunches, Whimpers, And Shrieks
inferredcites →https://doi.org/10.2307/2964544openalex-snapshot
Incompleteness along paths in progressions of theories
inferredcites →https://doi.org/10.5860/choice.33-5163openalex-snapshot
Bangs, crunches, whimpers, and shrieks: singularities and acausalities in relativistic spacetimes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.200310057openalex-snapshot
Pf ≠ NPf for almost all f
inferred← citeshttps://doi.org/10.1002/malq.201900008openalex-snapshot
The classification of countable models of set theory
inferred← citeshttps://doi.org/10.1007/11494645_14openalex-snapshot
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability
inferred← citeshttps://doi.org/10.1007/11494645_22openalex-snapshot
Infinitary Computability with Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1007/11494645_28openalex-snapshot
Computing a Model of Set Theory
inferred← citeshttps://doi.org/10.1007/11494645_65openalex-snapshot
The Transfinite Action of 1 Tape Turing Machines
inferred← citeshttps://doi.org/10.1007/11750321_61openalex-snapshot
Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable
inferred← citeshttps://doi.org/10.1007/11780342_27openalex-snapshot
Infinite Time Register Machines
inferred← citeshttps://doi.org/10.1007/11780342_34openalex-snapshot
Space Bounds for Infinitary Computation
inferred← citeshttps://doi.org/10.1007/11780342_40openalex-snapshot
Constraints on Hypercomputation
inferred← citeshttps://doi.org/10.1007/11780342_58openalex-snapshot
Non-deterministic Halting Times for Hamkins-Kidder Turing Machines
inferred← citeshttps://doi.org/10.1007/11787181_3openalex-snapshot
Revision Forever!
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_25openalex-snapshot
How Powerful Are Infinite Time Machines?
inferred← citeshttps://doi.org/10.1007/3-540-45833-6_2openalex-snapshot
Hypercomputation in the Chinese Room
inferred← citeshttps://doi.org/10.1007/3-540-45833-6_24openalex-snapshot
Relativistic Computers and Non-uniform Complexity Theory
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_23openalex-snapshot
On Randomness and Infinity
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_20openalex-snapshot
Infinite Time Computable Model Theory
inferred← citeshttps://doi.org/10.1007/978-1-84628-943-9_2openalex-snapshot
Infinitely Complex Machines
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_16openalex-snapshot
An algorithmic approach to characterizations of admissibles
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_2openalex-snapshot
Surreal Blum-Shub-Smale Machines
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_7openalex-snapshot
Higher Type Recursion for Transfinite Machine Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-51466-2_2openalex-snapshot
Clockability for Ordinal Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-030-64187-0_7openalex-snapshot
The Significance of Relativistic Computation for the Philosophy of Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_7openalex-snapshot
The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
inferred← citeshttps://doi.org/10.1007/978-3-030-84706-7_4openalex-snapshot
Exploring Mathematical Objects from Custom-Tailored Mathematical Universes
inferred← citeshttps://doi.org/10.1007/978-3-030-93100-1_18openalex-snapshot
Between Turing and Kleene
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_5openalex-snapshot
A Constructive Picture of Noetherian Conditions and Well Quasi-orders
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_6openalex-snapshot
Symmetry for Transfinite Computability
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_7openalex-snapshot
All Melodies Are Lost – Recognizability for Weak and Strong $$\alpha $$-Register Machines
inferred← citeshttps://doi.org/10.1007/978-3-031-95908-0_12openalex-snapshot
Transfinite Structured Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-95908-0_15openalex-snapshot
Full Generalized Effective Reducibility
inferred← citeshttps://doi.org/10.1007/978-3-319-08019-2_9openalex-snapshot
Algorithmic Randomness for Infinite Time Register Machines
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_14openalex-snapshot
$$ITRM$$-Recognizability from Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-319-22156-4_6openalex-snapshot
Discrete Transfinite Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_23openalex-snapshot
Generalized Effective Reducibility
inferred← citeshttps://doi.org/10.1007/978-3-319-58741-7_18openalex-snapshot
Admissibles in Gaps
inferred← citeshttps://doi.org/10.1007/978-3-319-58741-7_19openalex-snapshot
Koepke Machines and Satisfiability for Infinitary Propositional Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-58741-7_20openalex-snapshot
The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters
inferred← citeshttps://doi.org/10.1007/978-3-319-58741-7_22openalex-snapshot
Infinite Time Busy Beavers
inferred← citeshttps://doi.org/10.1007/978-3-319-61043-6_6openalex-snapshot
The Singularity Business
inferred← citeshttps://doi.org/10.1007/978-3-319-92402-1_9openalex-snapshot
Physical Computation and First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-93779-3_8openalex-snapshot
The Epistemology of Computer-Mediated Proofs
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_12openalex-snapshot
Some Observations on Infinitary Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_13openalex-snapshot
Taming Koepke’s Zoo
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_32openalex-snapshot
Functionals of Type 3 as Realisers of Classical Theorems in Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_34openalex-snapshot
An Enhanced Theory of Infinite Time Register Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_37openalex-snapshot
Post’s Problem for Ordinal Register Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_51openalex-snapshot
The Complexity of Quickly ORM-Decidable Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_68openalex-snapshot
Infinite Computations and a Hierarchy in Δ 3
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_82openalex-snapshot
Turing Unbound: Transfinite Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_86openalex-snapshot
(Short) Survey of Real Hypercomputation
inferred← citeshttps://doi.org/10.1007/978-3-540-74593-8_5openalex-snapshot
A Survey of Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-85194-3_18openalex-snapshot
Ultrafilter and Non-standard Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_14openalex-snapshot
Infinite-Time Turing Machines and Borel Reducibility
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_29openalex-snapshot
Ordinal Computability
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_8openalex-snapshot
Hyperloops Do Not Threaten the Notion of an Effective Procedure
inferred← citeshttps://doi.org/10.1007/978-3-642-03092-5_10openalex-snapshot
Is P = PSPACE for Infinite Time Turing Machines?
inferred← citeshttps://doi.org/10.1007/978-3-642-03745-0_11openalex-snapshot
Relativistic Computers and Transfinite Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-21875-0_19openalex-snapshot
Multi-Resolution Cellular Automata for Real Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-21875-0_3openalex-snapshot
A Computational Approach to an Alternative Working Environment for the Constructible Universe
inferred← citeshttps://doi.org/10.1007/978-3-642-27654-5_14openalex-snapshot
Some Transfinite Generalisations of Gödel’s Incompleteness Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_41openalex-snapshot
Towards a Theory of Infinite Time Blum-Shub-Smale Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-32560-1_19openalex-snapshot
Belief in The Singularity is Fideistic
inferred← citeshttps://doi.org/10.1007/978-3-642-39053-1_27openalex-snapshot
Cardinal-Recognizing Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1007/978-94-017-0466-3_3openalex-snapshot
Semantics and the Liar Paradox
inferred← citeshttps://doi.org/10.1007/978-981-10-5699-4_33openalex-snapshot
Fractal Information Theory (FIT)-Derived Geometric Musical Language (GML) for Brain-Inspired Hypercomputing
inferred← citeshttps://doi.org/10.1007/978-981-10-8049-4_1openalex-snapshot
A Brain-like Computer Made of Time Crystal: Could a Metric of Prime Alone Replace a User and Alleviate Programming Forever?
inferred← citeshttps://doi.org/10.1007/978-981-16-5723-8_5openalex-snapshot
Hypercomputation of the Brain by Superluminal Particles
inferred← citeshttps://doi.org/10.1007/978-981-19-9858-4_21openalex-snapshot
Turing Machines Behind the Horizon: Modeling Black Hole Interiors as Transfinite Limited Turing Machines
inferred← citeshttps://doi.org/10.1007/978-981-97-7610-8_5openalex-snapshot
Hyperberechnung des Gehirns durch überlichtschnelle Partikel
inferred← citeshttps://doi.org/10.1007/s00153-008-0093-3openalex-snapshot
Register computations on ordinals
inferred← citeshttps://doi.org/10.1007/s00153-009-0146-2openalex-snapshot
Infinite time extensions of Kleene’s $${\mathcal{O}}$$
inferred← citeshttps://doi.org/10.1007/s00153-009-0167-xopenalex-snapshot
The basic theory of infinite time register machines
inferred← citeshttps://doi.org/10.1007/s00153-018-0651-2openalex-snapshot
On the classification of vertex-transitive structures
inferred← citeshttps://doi.org/10.1007/s00153-019-00692-9openalex-snapshot
Weaker variants of infinite time Turing machines
inferred← citeshttps://doi.org/10.1007/s001530100112openalex-snapshot
Post's problem for supertasks has both positive and negative solutions
inferred← citeshttps://doi.org/10.1007/s00224-016-9681-5openalex-snapshot
Higher Randomness and Forcing with Closed Sets
inferred← citeshttps://doi.org/10.1007/s00605-002-0545-5openalex-snapshot
P?NP for Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1007/s10469-017-9425-xopenalex-snapshot
The Computational Power of Infinite Time Blum–Shub–Smale Machines
inferred← citeshttps://doi.org/10.1007/s10670-012-9363-xopenalex-snapshot
Ideal Negative Conceivability and the Halting Problem
inferred← citeshttps://doi.org/10.1007/s10699-014-9349-zopenalex-snapshot
Beyond Physics? On the Prospects of Finding a Meaningful Oracle
inferred← citeshttps://doi.org/10.1007/s10773-005-8984-0openalex-snapshot
Computational Power of Infinite Quantum Parallelism
inferred← citeshttps://doi.org/10.1007/s10838-014-9244-xopenalex-snapshot
Computable Diagonalizations and Turing’s Cardinality Paradox
inferred← citeshttps://doi.org/10.1007/s10992-018-9482-1openalex-snapshot
Rethinking Revision
inferred← citeshttps://doi.org/10.1007/s10998-016-0148-xopenalex-snapshot
A representation of recursively enumerable sets through Horn formulas in higher recursion theory
inferred← citeshttps://doi.org/10.1007/s11023-011-9222-6openalex-snapshot
On the Possibilities of Hypercomputing Supertasks
inferred← citeshttps://doi.org/10.1007/s11023-011-9238-yopenalex-snapshot
Do Accelerating Turing Machines Compute the Uncomputable?
inferred← citeshttps://doi.org/10.1007/s11023-017-9454-1openalex-snapshot
An Argument for P=NP
inferred← citeshttps://doi.org/10.1007/s11047-006-9016-6openalex-snapshot
A broader view on the limitations of information processing and communication by nature
inferred← citeshttps://doi.org/10.1007/s11047-009-9117-0openalex-snapshot
Abstract geometrical computation 3: black holes for classical and analog computing
inferred← citeshttps://doi.org/10.1007/s11047-010-9197-xopenalex-snapshot
Output concepts for accelerated Turing machines
inferred← citeshttps://doi.org/10.1007/s11047-011-9280-yopenalex-snapshot
Supertasks do not increase computational power
inferred← citeshttps://doi.org/10.1007/s11098-023-02039-wopenalex-snapshot
Limitative computational explanations
inferred← citeshttps://doi.org/10.1007/s11225-014-9581-0openalex-snapshot
Cofinally Invariant Sequences and Revision
inferred← citeshttps://doi.org/10.1007/s11229-026-05482-4openalex-snapshot
Varieties of confluence arguments, part 1: practical applications
inferred← citeshttps://doi.org/10.1007/s11787-018-0196-5openalex-snapshot
On TAE Machines and Their Computational Power
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50002-2openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem – A Correction
inferred← citeshttps://doi.org/10.1016/j.amc.2005.09.067openalex-snapshot
The case for hypercomputation
inferred← citeshttps://doi.org/10.1016/j.amc.2005.09.071openalex-snapshot
A new Gödelian argument for hypercomputing minds based on the busy beaver problem
inferred← citeshttps://doi.org/10.1016/j.amc.2005.09.076openalex-snapshot
The many forms of hypercomputation
inferred← citeshttps://doi.org/10.1016/j.amc.2007.02.146openalex-snapshot
Computability on reals, infinite limits and differential equations
inferred← citeshttps://doi.org/10.1016/j.apal.2009.01.004openalex-snapshot
Post’s Problem for ordinal register machines: An explicit approach
inferred← citeshttps://doi.org/10.1016/j.apal.2014.04.010openalex-snapshot
The distribution of ITRM-recognizable reals
inferred← citeshttps://doi.org/10.1016/j.apal.2014.04.016openalex-snapshot
The computational strengths of α-tape infinite time Turing machines
inferred← citeshttps://doi.org/10.1016/j.apal.2017.12.007openalex-snapshot
Recognizable sets and Woodin cardinals: computation beyond the constructible universe
inferred← citeshttps://doi.org/10.1016/j.apal.2021.103041openalex-snapshot
Taming Koepke's Zoo II: Register machines
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103741openalex-snapshot
Toward higher-order infinite time Turing machines: simulational $\Gamma$-machines
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.04.001openalex-snapshot
On Fixpoint Arithmetic and Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.05.001openalex-snapshot
Clocked population protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.001openalex-snapshot
Three aspects of super-recursive algorithms and hypercomputation or finding black swans
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.007openalex-snapshot
Super-tasks, accelerating Turing machines and uncomputability
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.010openalex-snapshot
The modal argument for hypercomputing minds
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.011openalex-snapshot
Hypercomputation by definition
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.12.012openalex-snapshot
Minimality considerations for ordinal computers modeling constructibility
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.12.014openalex-snapshot
Bounding lemmata for non-deterministic halting times of transfinite Turing machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.050openalex-snapshot
Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.040openalex-snapshot
Computation as an unbounded process
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.042openalex-snapshot
The expressive power of analog recurrent neural networks on infinite input streams
inferred← citeshttps://doi.org/10.1017/9781009227223openalex-snapshot
Iterative Conceptions of Set
inferred← citeshttps://doi.org/10.1017/cbo9780511863196.019openalex-snapshot
Oracles, Infinitary Computation, and the Physics of the Mind
inferred← citeshttps://doi.org/10.1017/cbo9780511863196.021openalex-snapshot
Turing Transcendent: Beyond the Event Horizon
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.015openalex-snapshot
Transfinite machine models
inferred← citeshttps://doi.org/10.1017/cbo9781139028592.004openalex-snapshot
Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
inferred← citeshttps://doi.org/10.1017/jsl.2015.26openalex-snapshot
SAFE RECURSIVE SET FUNCTIONS
inferred← citeshttps://doi.org/10.1017/jsl.2015.8openalex-snapshot
OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES
inferred← citeshttps://doi.org/10.1017/jsl.2018.3openalex-snapshot
RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
inferred← citeshttps://doi.org/10.1017/s0960129513000406openalex-snapshot
An injection from the Baire space to natural numbers
inferred← citeshttps://doi.org/10.1017/s1079898600004066openalex-snapshot
2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
inferred← citeshttps://doi.org/10.1017/s1755020308080118openalex-snapshot
ULTIMATE TRUTHVIS-À-VISSTABLE TRUTH
inferred← citeshttps://doi.org/10.1017/s175502030909025xopenalex-snapshot
A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS
inferred← citeshttps://doi.org/10.1017/s1755020313000361openalex-snapshot
SOME OBSERVATIONS ON TRUTH HIERARCHIES
inferred← citeshttps://doi.org/10.1023/a:1011933220835openalex-snapshot
Editorial Introduction
inferred← citeshttps://doi.org/10.1023/a:1011946004905openalex-snapshot
Set-Theoretic Absoluteness and the Revision Theory of Truth
inferred← citeshttps://doi.org/10.1023/a:1014019225365openalex-snapshot
Non-Turing Computations Via Malament–Hogarth Space-Times
inferred← citeshttps://doi.org/10.1023/a:1015603317236openalex-snapshot
Logically Possible Machines
inferred← citeshttps://doi.org/10.1023/a:1015607401307openalex-snapshot
Accelerating Turing Machines
inferred← citeshttps://doi.org/10.1023/a:1015659418145openalex-snapshot
Is There a Nonrecursive Decidable Equational Theory?
inferred← citeshttps://doi.org/10.1023/a:1021180801870openalex-snapshot
Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1023/a:1021307923600openalex-snapshot
Supermachines and Superminds
inferred← citeshttps://doi.org/10.1080/00207160310001606034openalex-snapshot
Nonlinear phenomena in spaces of algorithms
inferred← citeshttps://doi.org/10.1088/0951-7715/17/4/009openalex-snapshot
Dynamics and computation in functional shifts
inferred← citeshttps://doi.org/10.1093/bjps/54.2.181openalex-snapshot
Hypercomputation and the Physical Church‐Turing Thesis
inferred← citeshttps://doi.org/10.1093/bjps/55.4.739openalex-snapshot
On the Possibility, or Otherwise, of Hypercomputation
inferred← citeshttps://doi.org/10.1093/bjps/axp038openalex-snapshot
SAD Computers and Two Versions of the Church–Turing Thesis
inferred← citeshttps://doi.org/10.1093/bjps/axq016openalex-snapshot
A Note on the Physical Possibility of Transfinite Computation
inferred← citeshttps://doi.org/10.1093/comjnl/bxl062openalex-snapshot
Are There New Models of Computation? Reply to Wegner and Eberbach †
inferred← citeshttps://doi.org/10.1093/logcom/11.1.25openalex-snapshot
Revision Sequences and Computers with an Infinite Amount of Time
inferred← citeshttps://doi.org/10.1093/logcom/exaa002openalex-snapshot
An introduction to feedback Turing computability
inferred← citeshttps://doi.org/10.1093/logcom/exaa022openalex-snapshot
Elementary cellular automata and self-referential paradoxes
inferred← citeshttps://doi.org/10.1093/logcom/exaa025openalex-snapshot
Space and time complexity for infinite time Turing machines
inferred← citeshttps://doi.org/10.1093/logcom/exab042openalex-snapshot
A recursion theoretic foundation of computation over real numbers
inferred← citeshttps://doi.org/10.1093/logcom/exi022openalex-snapshot
P ≠ NP ∩ co-NP for Infinite Time Turing Machines
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.001.0001openalex-snapshot
The Nature of Physical Computation
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.002.0004openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0002openalex-snapshot
Desiderata of a Theory of Computation
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0003openalex-snapshot
Turing’s Computability
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0004openalex-snapshot
Preamble to Machine Computation
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0005openalex-snapshot
Computation as Step-Satisfaction
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0006openalex-snapshot
Computation as Implementation
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0007openalex-snapshot
Computation as Mechanism
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0008openalex-snapshot
The Semantic View of Computation
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0009openalex-snapshot
An Argument for the Semantic View
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0010openalex-snapshot
Computing as Modeling
inferred← citeshttps://doi.org/10.1093/oso/9780197552384.003.0011openalex-snapshot
Conclusion
inferred← citeshttps://doi.org/10.1093/philmat/nkac015openalex-snapshot
The Role of Imagination and Anticipation in the Acceptance of Computability Proofs: A Challenge to the Standard Account of Rigor
inferred← citeshttps://doi.org/10.1093/philmat/nky011openalex-snapshot
Human-Effective Computability†
inferred← citeshttps://doi.org/10.1093/phisci/axi108openalex-snapshot
The Diagonal Method and Hypercomputation
inferred← citeshttps://doi.org/10.1109/csci62032.2023.00073openalex-snapshot
Understanding the Computational Complexity of Diverse Classes of Turing and Super-Turing Computational Models
inferred← citeshttps://doi.org/10.1109/lics.2015.55openalex-snapshot
Feedback Turing Computability, and Turing Computability as Feedback
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00094openalex-snapshot
Productive Quantum Programming Needs Better Abstract Machines
inferred← citeshttps://doi.org/10.1134/s0001434626604375openalex-snapshot
On Petr Novikov’s Problem about Ordered Systems of Uniform Sets
inferred← citeshttps://doi.org/10.1142/9789811236488_0004openalex-snapshot
Generalized Spaces for Constructive Algebra
inferred← citeshttps://doi.org/10.1142/9789813223523_0005openalex-snapshot
COBHAM RECURSIVE SET FUNCTIONS AND WEAK SET THEORIES
inferred← citeshttps://doi.org/10.1142/s0129626412400129openalex-snapshot
THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION'
inferred← citeshttps://doi.org/10.1145/1778765.1778863openalex-snapshot
Parametric reshaping of human bodies in images
inferred← citeshttps://doi.org/10.1145/3087801.3087836openalex-snapshot
Clocked Population Protocols
inferred← citeshttps://doi.org/10.1145/384150.384166openalex-snapshot
How we know what technology can do
inferred← citeshttps://doi.org/10.1215/00294527-1306199openalex-snapshot
Infinite Time Decidable Equivalence Relation Theory
inferred← citeshttps://doi.org/10.1215/00294527-2022-0012openalex-snapshot
Decision Times of Infinite Computations
inferred← citeshttps://doi.org/10.1215/00294527-3832619openalex-snapshot
Infinite Computations with Random Oracles
inferred← citeshttps://doi.org/10.1353/lac.2016.0017openalex-snapshot
Ed Fredkin and the Physics of Information: An Inside Story of an Outsider Scientist
inferred← citeshttps://doi.org/10.1515/9783110324907.341openalex-snapshot
ITTMs with Feedback
inferred← citeshttps://doi.org/10.18122/b2jh7dopenalex-snapshot
Classification of Vertex-Transitive Structures
inferred← citeshttps://doi.org/10.18489/sacj.v30i1.580openalex-snapshot
On More or Less Appropriate Notions of ‘Computation’
inferred← citeshttps://doi.org/10.20944/preprints202405.2041.v1openalex-snapshot
Time-travelling Turing Machines and the Self-consistent Halting Problem
inferred← citeshttps://doi.org/10.2168/lmcs-7(3:11)2011openalex-snapshot
Real Analytic Machines and Degrees
inferred← citeshttps://doi.org/10.2178/bsl/1122038993openalex-snapshot
Turing Computations On Ordinals
inferred← citeshttps://doi.org/10.2178/bsl/1174668222openalex-snapshot
2006 Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2178/jsl/1052669071openalex-snapshot
On revision operators
inferred← citeshttps://doi.org/10.2178/jsl/1305810756openalex-snapshot
Weak systems of determinacy and arithmetical quasi-inductive definitions
inferred← citeshttps://doi.org/10.2178/jsl/1305810767openalex-snapshot
Hypermachines
inferred← citeshttps://doi.org/10.2307/2183531openalex-snapshot
On the Possibility of Completing an Infinite Process
inferred← citeshttps://doi.org/10.2307/2586695openalex-snapshot
Eventually infinite time Turing machine degrees: infinite time decidable reals
inferred← citeshttps://doi.org/10.23638/lmcs-15(2:7)2019openalex-snapshot
Feedback computability on Cantor space
inferred← citeshttps://doi.org/10.23638/lmcs-16(2:2)2020openalex-snapshot
Reachability for infinite time Turing machines with long tapes
inferred← citeshttps://doi.org/10.2979/trancharpeirsoc.48.3.356openalex-snapshot
Royce's Model of the Absolute
inferred← citeshttps://doi.org/10.2991/agi.2009.38openalex-snapshot
General Intelligence and Hypercomputation
inferred← citeshttps://doi.org/10.31235/osf.io/hywjzopenalex-snapshot
SAD computers and two versions of the Church–Turing Thesis
inferred← citeshttps://doi.org/10.31235/osf.io/pqd8popenalex-snapshot
Hyperloops do not threaten the notion of an effective procedure
showing the first 200 of 239 · page through all 239
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.