Some Transfinite Generalisations of Gödel’s Incompleteness Theorem
From MaRDI portal
Publication:2891311
DOI10.1007/978-3-642-27654-5_14zbMath1353.03076OpenAlexW126781605MaRDI QIDQ2891311
Publication date: 15 June 2012
Published in: Computation, Physics and Beyond (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27654-5_14
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical recursion theory. The theory of functions and sets of natural numbers
- Is independence an exception?
- Is complexity a source of incompleteness?
- A note on accelerated Turing machines
- Turing Computations On Ordinals
- Ordinal computations
- Hypercomputation
- Infinite time Turing machines
- Turing Unbound: Transfinite Computation
This page was built for publication: Some Transfinite Generalisations of Gödel’s Incompleteness Theorem
