Turing Unbound: Transfinite Computation

DOI10.1007/978-3-540-73001-9_82MaRDI QIDQ5425382zbMATH OpenOpenAlexFDO

Authors Philip D. Welch

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73001-9_82

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Recommendations

• Analog computation beyond the Turing limit
• Infinite time Turing machines
• scientific article; zbMATH DE number 1909819

Cited in

(8)

• Some transfinite generalisations of Gödel's incompleteness theorem
• Turing Jumps Through Provability
• Ultrafilter and Non-standard Turing Machines
• Unconventional “Stateless” Turing–Like Machines
• Computation as an unbounded process
• scientific article; zbMATH DE number 4125367 (Why is no real title available?)
• scientific article; zbMATH DE number 1909819 (Why is no real title available?)
• Symmetry for transfinite computability

This page was built for publication: Turing Unbound: Transfinite Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425382)