- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Ordinal Computability: An Introduction to Infinitary Machines
Boston: De Gruyter (2019)
Abstract
Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics, including set theory and model theory, are covered.Author's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Chapters
Similar books and articles
Register computations on ordinals.Peter Koepke & Ryan Siders - 2008 - Archive for Mathematical Logic 47 (6):529-548.
Infinite Computations with Random Oracles.Merlin Carl & Philipp Schlicht - 2017 - Notre Dame Journal of Formal Logic 58 (2):249-270.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.
The basic theory of infinite time register machines.Merlin Carl, Tim Fischbach, Peter Koepke, Russell Miller, Miriam Nasfi & Gregor Weckbecker - 2010 - Archive for Mathematical Logic 49 (2):249-273.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Post’s Problem for ordinal register machines: An explicit approach.Joel David Hamkins & Russell G. Miller - 2009 - Annals of Pure and Applied Logic 160 (3):302-309.
Ordinal analysis by transformations.Henry Towsner - 2009 - Annals of Pure and Applied Logic 157 (2-3):269-280.
Review: W. Pohlers, Cut-Elimination for Impredicative Infinitary Systems. Part I. Ordinal- Analysis for $ID_1$; W. Pohlers, Cut Elimination for Impredicative Infinitary Systems. Part II. Ordinal Analysis for Iterated Inductive Definitions. [REVIEW]Kurt Schutte - 1983 - Journal of Symbolic Logic 48 (3):879-880.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Turing oracle machines, online computing, and three displacements in computability theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.
Analytics
Added to PP
2020-01-31
Downloads
21 (#730,352)
6 months
7 (#419,843)
2020-01-31
Downloads
21 (#730,352)
6 months
7 (#419,843)
Historical graph of downloads
Author's Profile
Citations of this work
Decision Times of Infinite Computations.Merlin Carl, Philipp Schlicht & Philip Welch - 2022 - Notre Dame Journal of Formal Logic 63 (2).
Taming Koepke's Zoo II: Register machines.Merlin Carl - 2022 - Annals of Pure and Applied Logic 173 (3):103041.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-659b74868d-w5f9g uwo