Infinite Time Turing Machines With Only One Tape
Work
Year: 2001
Type: article
Abstract: Infinite time Turing machines with only one tape are in many respects fully as powerful as their multi-tape cousins. In particular, the two models of machine give rise to the same class of decidable s... more
Source: Mathematical logic quarterly
Institution City University of New York
Cites:
Cited by: 27
Related to: 10
FWCI: 0.824
Citation percentile (by year/subfield): 85.75
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze