On analogues of the church–turing thesis in algorithmic randomness

Review of Symbolic Logic 9 (3):456-479 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s1755020316000113

Links

PhilArchive



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

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

Reflections on gödel's and Gandy's reflections on Turing's thesis.David Israel - 2002 - Minds and Machines 12 (2):181-201.
The Church-Turing Thesis.B. Jack Copeland - 2014 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. Stanford, CA: The Metaphysics Research Lab.
SAD computers and two versions of the Church–Turing thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
Randomness and Semimeasures.Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter & Paul Shafer - 2017 - Notre Dame Journal of Formal Logic 58 (3):301-328.
Hypercomputation and the Physical Church‐Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.
Physical hypercomputation and the church–turing thesis.Oron Shagrir & Itamar Pitowsky - 2003 - Minds and Machines 13 (1):87-101.
The Church-Turing ‘Thesis’ as a Special Corollary of Gödel’s Completeness Theorem.Saul A. Kripke - 2013 - In B. J. Copeland, C. Posy & O. Shagrir (eds.), Computability: Gödel, Turing, Church, and beyond. MIT Press.
A natural axiomatization of computability and proof of Church’s thesis.Nachum Dershowitz & Yuri Gurevich - 2008 - Bulletin of Symbolic Logic 14 (3):299-350.
Continuous higher randomness.Laurent Bienvenu, Noam Greenberg & Benoit Monin - 2017 - Journal of Mathematical Logic 17 (1):1750004.
How to Make a Meaningful Comparison of Models: The Church–Turing Thesis Over the Reals.Maël Pégny - 2016 - Minds and Machines 26 (4):359-388.
Quantum speed-up of computations.Itamar Pitowsky - 2002 - Proceedings of the Philosophy of Science Association 2002 (3):S168-S177.
Thinking machines: Some fundamental confusions. [REVIEW]John T. Kearns - 1997 - Minds and Machines 7 (2):269-87.
Computationalism, The Church–Turing Thesis, and the Church–Turing Fallacy.Gualtiero Piccinini - 2007 - Synthese 154 (1):97-120.
Probabilistic algorithmic randomness.Sam Buss & Mia Minnes - 2013 - Journal of Symbolic Logic 78 (2):579-601.
Algorithmic randomness and measures of complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.

Analytics

Added to PP
2017-04-24

Downloads
33 (#472,429)

6 months
13 (#182,749)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Christopher Porter
Drake University

Citations of this work

Chance versus Randomness.Antony Eagle - 2010 - Stanford Encyclopedia of Philosophy.
The Equivalence of Definitions of Algorithmic Randomness.Christopher Porter - 2021 - Philosophia Mathematica 29 (2):153–194.

Add more citations

References found in this work

Probabilities over rich languages, testing and randomness.Haim Gaifman & Marc Snir - 1982 - Journal of Symbolic Logic 47 (3):495-548.
Recognizing strong random reals.Daniel Osherson - 2008 - Review of Symbolic Logic 1 (1):56-63.

Add more references