You have Guest access.
Log In
Philip D. Welch
Book Chapter
Supertask computation
Joel David Hamkins
Trends in Logic, 1, Volume 23, Classical and New Paradigms of Computation and their Complexity Hierarchies, Pages 141-158
A Survey of Infinite Time Turing Machines
Lecture Notes in Computer Science, 2007, Volume 4664, Machines, Computations, and Universality, Pages 62-71
Turing Unbound: Transfinite Computation
Lecture Notes in Computer Science, 2007, Volume 4497, Computation and Logic in the Real World, Pages 768-780
Space Bounds for Infinitary Computation
Benedikt Löwe
Lecture Notes in Computer Science, 2006, Volume 3988, Logical Approaches to Computational Barriers, Pages 319-329
Journal Article
Infinite Time Turing Machines
Minds and Machines, 2002, Volume 12, Number 4, Pages 521-539
Infinitary Computability with Infinite Time Turing Machines
Lecture Notes in Computer Science, 2005, Volume 3526, New Computational Paradigms, Pages 1-7
The Transfinite Action of 1 Tape Turing Machines
Lecture Notes in Computer Science, 2005, Volume 3526, New Computational Paradigms, Pages 156-162
Complexity hierarchies derived from reduction functions
Trends in Logic, 1, Volume 23, Classical and New Paradigms of Computation and their Complexity Hierarchies, Pages 1-14
(Short) Survey of Real Hypercomputation
Martin Ziegler
Lecture Notes in Computer Science, 2007, Volume 4497, Computation and Logic in the Real World, Pages 809-824
Non-deterministic Halting Times for Hamkins-Kidder Turing Machines
P. D. Welch
Lecture Notes in Computer Science, 2006, Volume 3988, Logical Approaches to Computational Barriers, Pages 571-574
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info