BianchettiM032017T.pdf (1.21 MB)
Infinite Time Computation: Strong and Weak Infinite Time Turing Machines
thesis
posted on 2017-03-30, 00:00 authored by Matteo BianchettiHamkins and Lewis have used infinite time Turing machines to extend the operations of Turing machines to infinite ordinal time. This project investigates some applications of these machines to basic operations and relations over the reals. It also investigates variants of these machines with extra-tapes or extra read-write heads. Then, this project investigates strictly weaker variants of these machines, which are obtained by allowing the content in each cell to change only finitely often. It is shown that these weaker machines can already compute basic operations and relations over the reals. Finally, the computational power of these machines is further investigated.
History
Date Created
2017-03-30Date Modified
2018-10-30Research Director(s)
Julia F. KnightCommittee Members
Gregory Igusa Peter CholakDegree
- Master of Science in Interdisciplinary Mathematics
Degree Level
- Master's Thesis
Language
- English
Program Name
- Mathematics
Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC