Turing Unbound: Transfinite Computation

DOI10.1007/978-3-540-73001-9_82zbMath1136.68398OpenAlexW1600063962MaRDI QIDQ5425382

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)

Related Items (1)

Some Transfinite Generalisations of Gödel’s Incompleteness Theorem

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