Discrete Transfinite Computation

P. D. Welch ()
Additional contact information
P. D. Welch: University of Bristol, School of Mathematics

A chapter in Turing’s Revolution, 2015, pp 161-185 from Springer

Abstract: Abstract We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have longer tapes than the standard model, or that work on ordinals rather than numbers. We outline the connections between such models and the older theories of recursion in higher types, generalized recursion theory, and recursion on ordinals such as α-recursion. We conclude that, in particular, polynomial time computation on ω-strings is well modelled by several convergent conceptions.

Keywords: Turing machine; Computability; Generalized recursion theory; Constructibility (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-22156-4_6

Ordering information: This item can be ordered from
http://www.springer.com/9783319221564

DOI: 10.1007/978-3-319-22156-4_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().