- 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
Infinite time Turing machines
Journal of Symbolic Logic 65 (2):567-604 (2000)
Abstract
Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and limitations of supertask algorithms.Author's Profile
Links
PhilArchive
External links
- From the Publisher via CrossRef (no proxy)
- arxiv.org
(no proxy) - dl.acm.org (no proxy)
- dl.acm.org [2] (no proxy)
- dl.acm.org [3] (no proxy)
- dl.acm.org [4] (no proxy)
- dl.acm.org [5] (no proxy)
- dx.doi.org (no proxy)
- link.springer.com (no proxy)
- link.springer.com [2] (no proxy)
- portal.acm.org (no proxy)
- portal.acm.org [2] (no proxy)
- portal.acm.org [3] (no proxy)
- projecteuclid.org (no proxy)
- projecteuclid.org [2] (no proxy)
- journals.cambridge.org (no proxy)
- jstor.org (no proxy)
- jstor.org [2] (no proxy)
- jstor.org [3] (no proxy)
- cambridge.org (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
Similar books and articles
Eventually infinite time Turing machine degrees: Infinite time decidable reals.P. D. Welch - 2000 - Journal of Symbolic Logic 65 (3):1193-1203.
On the possibility, or otherwise, of hypercomputation.Philip D. Welch - 2004 - British Journal for the Philosophy of Science 55 (4):739-746.
Infinitely Complex Machines.Eric Steinhart - 2007 - In Intelligent Computing Everywhere. Springer. pp. 25-43.
Observability of Turing Machines: a refinement of the theory of computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
Analytics
Added to PP
2009-01-28
Downloads
107 (#157,209)
6 months
21 (#111,627)
2009-01-28
Downloads
107 (#157,209)
6 months
21 (#111,627)
Historical graph of downloads
Author's Profile
Citations of this work
The Physical Church–Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.
Do Accelerating Turing Machines Compute the Uncomputable?B. Jack Copeland & Oron Shagrir - 2011 - Minds and Machines 21 (2):221-239.
References found in this work
Forever is a day: Supertasks in Pitowsky and Malament-Hogarth spacetimes.John Earman & John D. Norton - 1993 - Philosophy of Science 60 (1):22-42.
Bangs, Crunches, Whimpers, and Shrieks: Singularities and Acausalities in Relativistic Spacetimes.Craig Callender & John Earman - 1998 - Philosophical Review 107 (1):142.
The Physical Church Thesis and Physical Computational Complexity.Itamar Pitowski - 1990 - Iyyun 39:81-99.
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-6d9b7f7c4c-tstkh uwo