- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On analogues of the church–turing thesis in algorithmic randomness
Review of Symbolic Logic 9 (3):456-479 (2016)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Coarse reducibility and algorithmic randomness.Denis R. Hirschfeldt, Carl G. Jockusch, Rutger Kuyper & Paul E. Schupp - 2016 - Journal of Symbolic Logic 81 (3):1028-1046.
Hypercomputation and the Physical Church‐Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.
Algorithmic randomness and measures of complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Algorithmic randomness and complexity. Theory and Applications of Computability.Rodney G. Downey & Denis R. Hirschfeldt - 2012 - Bulletin of Symbolic Logic 18 (1):126-128.
A note on the learning-theoretic characterizations of randomness and convergence.Tomasz Steifer - forthcoming - Review of Symbolic Logic:1-15.
Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory.J. C. Shepherdson, A. J. Kfoury, R. Statman & Robert E. Byerly - 1990 - Journal of Symbolic Logic 55 (2):876-878.
Review: A. Porter, P. K. T. Vaswani, The Optimization of Logical Goal-Seeking Procedures. [REVIEW]Alan Rose - 1970 - Journal of Symbolic Logic 35 (4):597-597.
Analytics
Added to PP
2017-04-24
Downloads
38 (#473,311)
6 months
17 (#260,151)
2017-04-24
Downloads
38 (#473,311)
6 months
17 (#260,151)
Historical graph of downloads
Author's Profile
Citations of this work
The Equivalence of Definitions of Algorithmic Randomness.Christopher Porter - 2021 - Philosophia Mathematica 29 (2):153–194.
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.
Making sense of randomness: Implicit encoding as a basis for judgment.Ruma Falk & Clifford Konold - 1997 - Psychological Review 104 (2):301-318.
Algorithmic information theory and undecidability.Panu Raatikainen - 2000 - Synthese 123 (2):217-225.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-9b866bbb8-sl6b2 uwo