Programming Infinite Machines

Erkenntnis 87 (1):181-189 (2019)
  Copy   BIBTEX

Abstract

For infinite machines that are free from the classical Thomson’s lamp paradox, we show that they are not free from its inverted-in-time version. We provide a program for infinite machines and an infinite mechanism that demonstrate this paradox. While their finite analogs work predictably, the program and the infinite mechanism demonstrate an undefined behavior. As in the case of infinite Davies machines :671–682, 2001), our examples are free from infinite masses, infinite velocities, infinite forces, etc. Only infinite divisibility of space and time is assumed. Thus, the infinite devices considered are possible in a Newtonian Universe and they do not conflict with Newtonian mechanics. Note that the classical Thomson’s lamp paradox leads to infinite velocities which may not be producible in acceptable models of Newtonian mechanics. Finally, it is shown that the “paradox of predictability” is similar to the inverted Thomson’s lamp paradox.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,829

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

Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
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.
Infinite Regress Arguments.Jan Willem Wieland - 2013 - Acta Analytica 28 (1):95-109.
Building infinite machines.E. B. Davies - 2001 - British Journal for the Philosophy of Science 52 (4):671-682.
Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.
Infinite chains and antichains in computable partial orderings.E. Herrmann - 2001 - Journal of Symbolic Logic 66 (2):923-934.

Analytics

Added to PP
2019-12-24

Downloads
25 (#631,726)

6 months
7 (#425,099)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Computability and Logic.George S. Boolos, John P. Burgess & Richard C. Jeffrey - 1974 - Cambridge, England: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
Computability and Logic.George S. Boolos, John P. Burgess & Richard C. Jeffrey - 2003 - Bulletin of Symbolic Logic 9 (4):520-521.
Tasks and Supertasks.James Thomson - 1954 - Analysis 15 (1):1--13.
Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.
Infinite pains: the trouble with supertasks.John Earman & John Norton - 1996 - In Adam Morton & Stephen P. Stich (eds.), Benacerraf and His Critics. Blackwell. pp. 11--271.

View all 15 references / Add more references