Michael O. Rabin and Hao Wang. Words in the history of a Turing machine with a fixed input. Journal of the Association for Computing Machinery, vol. 10 , pp. 526–527 [Book Review]

Journal of Symbolic Logic 34 (3):508 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270936

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

My notes

Similar books and articles

Review: Michael O. Rabin, Hao Wang, Words in the History of a Turing Machine with a Fixed Input. [REVIEW]Joyce Friedman - 1969 - Journal of Symbolic Logic 34 (3):508-508.
Words in the History of a Turing Machine with a Fixed Input.Michael O. Rabin & Hao Wang - 1969 - Journal of Symbolic Logic 34 (3):508-508.
Beyond the universal Turing machine.Jack Copeland - 1999 - Australasian Journal of Philosophy 77 (1):46-67.
Patrick C. Fischer. On formalisms for Turing machines. Journal of the Association for Computing Machinery, vol. 12 , pp. 570–580. - Stål Aanderaa and Patrick C. Fischer. The solvability of the halting problem for 2-state Post machines. Journal of the Association for Computing Machinery, vol. 14 , pp. 677–682. - Patrick C. Fischer. Quantificational variants on the halting problem for Turing machines. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 15 , pp. 211–218. [REVIEW]Gabor T. Herman - 1971 - Journal of Symbolic Logic 36 (3):532-534.
Towards a Historical Notion of ‘Turing—the Father of Computer Science’.Edgar G. Daylight - 2015 - History and Philosophy of Logic 36 (3):205-228.
Wang Hao. Tag systems and lag systems. Mathematische Annalen, vol. 152 , pp. 65–74.Cocke John and Minsky Marvin. Universality of tag systems with D = 2. Journal of the Association for Computing Machinery, vol. 11 , pp. 15–20.Cook Stephen A.. The solvability of the derivability problem for one-normal systems. Journal of the Association for Computing Machinery, vol. 13 , pp. 223–225. [REVIEW]Ann Yasuhara - 1971 - Journal of Symbolic Logic 36 (2):344.
MICHAEL POLANYI: CAN THE MIND BE REPRESENTED BY A MACHINE?Paul Richard Blum - 2010 - Polanyiana 19 (1-2):35-60.
Michael Arbib. Turing machines, finite automata and neural nets. Journal of the Association for Computing Machinery, vol. 8 , pp. 467–475. [REVIEW]Joseph S. Ullian - 1970 - Journal of Symbolic Logic 35 (3):482.
Notes on the Turing test.C. Crawford - 1994 - Communications of the Association for Computing Machinery 37 (June):13-15.
Empirical Investigations: Reflecting on Turing and Wittgenstein on Thinking Machines.Jonathan Livengood & Justin Sytsma - unknown
Do Accelerating Turing Machines Compute the Uncomputable?B. Jack Copeland & Oron Shagrir - 2011 - Minds and Machines 21 (2):221-239.
A universal socio-technical computing machine.Markus Luczak-Roesch, Ramine Tinati, Saud Aljaloud, Wendy Hall & Nigel Shadbolt - 2016 - In Markus Luczak-Roesch, Ramine Tinati, Saud Aljaloud, Wendy Hall & Nigel Shadbolt (eds.), International Conference on Web Engineering.
Bringing up Turing's 'Child-Machine'.Susan G. Sterrett - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 703--713.
Lessons from a restricted Turing test.Stuart M. Shieber - 1994 - Communications of the Association for Computing Machinery 37:70-82.
Lin Shen and Rado Tibor. Computer studies of Turing machine problems. Journal of the Association for Computing Machinery, vol. 12 , pp. 196–212.Brady Allen H.. The conjectured highest scoring machines for Rado's Σ for the value k = 4. IEEE transactions on electronic computers, vol. EC-15 , pp. 802–803.Green Milton W.. A lower bound on Rado's sigma function for binary Turing machines. Switching circuit theory and logical design, Proceedings of the Fifth Annual Symposium, Princeton University, Princeton, N.J., November 11-13, 1964, The Institute of Electrical and Electronics Engineers, Inc., New York 1964, pp. 91–94. [REVIEW]H. B. Enderton - 1975 - Journal of Symbolic Logic 40 (4):617-617.

Analytics

Added to PP
2016-06-30

Downloads
18 (#808,169)

6 months
7 (#425,192)

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