A Note on the Physical Possibility of Transfinite Computation

British Journal for the Philosophy of Science 61 (4):867-874 (2010)
  Copy   BIBTEX

Abstract

In this note, we consider constraints on the physical possibility of transfinite Turing machines that arise from how one models the continuous structure of space and time in one's best physical theories. We conclude by suggesting a version of Church's thesis appropriate as an upper bound for physical computation given how space and time are modeled on our current physical theories

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2010-11-25

Downloads
68 (#245,849)

6 months
12 (#242,953)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeffrey Barrett
University of California, Irvine

Citations of this work

No citations found.

Add more citations

References found in this work

Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Deciding arithmetic using SAD computers.Mark Hogarth - 2004 - British Journal for the Philosophy of Science 55 (4):681-691.
SAD computers and two versions of the Church–Turing thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.

View all 12 references / Add more references