Review: Shen Lin, Tibor Rado, Computer Studies of Turing Machine Problems; Allen H. Brady, The Conjectured Highest Scoring Machines for Rado's $sum(k)$ for the Value $K = 4$; Milton W. Green, A Lower Bound on Rado's Sigma Function for Binary Turing Machines [Book Review]

Journal of Symbolic Logic 40 (4):617-617 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Castor quadruplorum.Arnold Oberschelp, Karsten Schmidt-Göttsch & Günter Todt - 1988 - Archive for Mathematical Logic 27 (1):35-44.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Is the human mind a Turing machine?D. King - 1996 - Synthese 108 (3):379-89.
Undecidability in the imitation game.Y. Sato & T. Ikegami - 2004 - Minds and Machines 14 (2):133-43.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
The broad conception of computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.
Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
Logically possible machines.Eric Steinhart - 2002 - Minds and Machines 12 (2):259-280.

Analytics

Added to PP
2013-11-22

Downloads
27 (#574,515)

6 months
6 (#504,917)

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

No references found.

Add more references