Computability by Probabilistic Machines

, , &
Journal of Symbolic Logic 35 (3):481-482 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270760

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,497

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: K. de Leeuw, E. F. Moore, C. E. Shannon, N. Shapiro, Computability by Probabilistic Machines. [REVIEW]Patrick C. Fischer - 1970 - Journal of Symbolic Logic 35 (3):481-482.
Turing oracle machines, online computing, and three displacements in computability theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Even Turing machines can compute uncomputable functions.Jack Copeland - unknown
Turing-, human- and physical computability: An unasked question. [REVIEW]Eli Dresner - 2008 - Minds and Machines 18 (3):349-355.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Probabilistic Belief Contraction.Raghav Ramachandran, Arthur Ramer & Abhaya C. Nayak - 2012 - Minds and Machines 22 (4):325-351.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
A guarded fragment for abstract state machines.Antje Nowack - 2005 - Journal of Logic, Language and Information 14 (3):345-368.
Probabilistic Grammars and Languages.András Kornai - 2011 - Journal of Logic, Language and Information 20 (3):317-328.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
On the possibility, or otherwise, of hypercomputation.Philip D. Welch - 2004 - British Journal for the Philosophy of Science 55 (4):739-746.
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.

Analytics

Added to PP
2015-02-05

Downloads
60 (#270,323)

6 months
10 (#280,381)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The philosophy of computer science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.
Effective Packing Dimension and Traceability.Rod Downey & Keng Meng Ng - 2010 - Notre Dame Journal of Formal Logic 51 (2):279-290.

View all 9 citations / Add more citations

References found in this work

No references found.

Add more references