Discrete Transfinite Computation
From MaRDI portal
Publication:2906573
DOI10.1007/978-3-319-22156-4_6zbMath1301.03039arXiv1409.5052OpenAlexW1904838180MaRDI QIDQ2906573
Publication date: 5 September 2012
Published in: Turing’s Revolution (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.5052
Inner models, including constructibility, ordinal definability, and core models (03E45) Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)
Related Items
The computational strengths of \(\alpha\)-tape infinite time Turing machines ⋮ Characterizations of ITBM-computability. I ⋮ The lost melody theorem for infinite time Blum-Shub-Smale machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
- Post's problem for ordinal register machines: an explicit approach
- Ordinal machines and admissible recursion theory
- Notes on naive semantics
- A new recursion-theoretic characterization of the polytime functions
- Post's problem for supertasks has both positive and negative solutions
- A revenge-immune solution to the semantic paradoxes
- The basic theory of infinite time register machines
- Infinite Time Turing Machines With Only One Tape
- Revision Sequences and Computers with an Infinite Amount of Time
- Hypermachines
- A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0
- Recursive Functionals and Quantifiers of Finite Types I
- Turing Computations On Ordinals
- Ordinal computations
- An Enhanced Theory of Infinite Time Register Machines
- ULTIMATE TRUTHVIS-À-VISSTABLE TRUTH
- The truth is never simple
- Splitting an α-Recursively Enumerable Set
- The recursively enumerable α-degrees are dense
- Infinite time Turing machines
- Eventually infinite time Turing machine degrees: infinite time decidable reals
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Post's Problem, Admissible Ordinals, and Regularity
- Turing-Machine Computable Functionals of Finite Types II†
- Trial and error predicates and the solution to a problem of Mostowski
- Limiting recursion
- Computability of Recursive Functions
- Recursive Functionals and Quantifiers of Finite Types II
