Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Course Roadmap and Historical Perspective Read chapter Read first chapter

1997 | OriginalPaper | Chapter

Universal Machines and Diagonalization

Author : Dexter C. Kozen

Published in: Automata and Computability

Publisher: Springer New York

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Now we come to a crucial observation about the power of Turing machines: there exist Turing machines that can simulate other Turing machines whose descriptions are presented as part of the input. There is nothing mysterious about this; it is the same as writing a LISP interpreter in LISP.

previous chapter Equivalent Models
next chapter Decidable and Undecidable Problems
Metadata
Title
Universal Machines and Diagonalization
Author
Dexter C. Kozen
Copyright Year
1997
Publisher
Springer New York
Book
Automata and Computability

Print ISBN: 978-1-4612-7309-7

Electronic ISBN: 978-1-4612-1844-9

Copyright Year: 1997

DOI
https://doi.org/10.1007/978-1-4612-1844-9_39