- 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
A characterization of complexity sequences
Mathematical Logic Quarterly 21 (1):47-56 (1975)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
On Schnorr and computable randomness, martingales, and machines.Rod Downey, Evan Griffiths & Geoffrey Laforte - 2004 - Mathematical Logic Quarterly 50 (6):613-627.
Truth-table Schnorr randomness and truth-table reducible randomness.Kenshi Miyabe - 2011 - Mathematical Logic Quarterly 57 (3):323-338.
Schnorr Randomness.Rodney G. Downey & Evan J. Griffiths - 2004 - Journal of Symbolic Logic 69 (2):533 - 554.
Schnorr randomness.Rodney G. Downey & Evan J. Griffiths - 2004 - Journal of Symbolic Logic 69 (2):533-554.
Generic separations and leaf languages.M. Galota, H. Vollmer & S. Kosub - 2003 - Mathematical Logic Quarterly 49 (4):353.
Relativized Schnorr tests with universal behavior.Nicholas Rupprecht - 2010 - Archive for Mathematical Logic 49 (5):555-570.
Every 2-random real is Kolmogorov random.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (3):907-913.
General random sequences and learnable sequences.C. P. Schnorr & P. Fuchs - 1977 - Journal of Symbolic Logic 42 (3):329-340.
Schnorr trivial reals: a construction. [REVIEW]Johanna N. Y. Franklin - 2008 - Archive for Mathematical Logic 46 (7-8):665-678.
On superstable groups with residual properties.Abderezak Houcine - 2007 - Mathematical Logic Quarterly 53 (1):19-26.
Analytics
Added to PP
2013-11-24
Downloads
11 (#1,149,542)
6 months
2 (#1,448,741)
2013-11-24
Downloads
11 (#1,149,542)
6 months
2 (#1,448,741)
Historical graph of downloads
Citations of this work
Characterization of realizable space complexities.Joel I. Seiferas & Albert R. Meyer - 1995 - Annals of Pure and Applied Logic 73 (2):171-190.
References found in this work
Computational speed-up by effective operators.Albert R. Meyer & Patrick C. Fischer - 1972 - Journal of Symbolic Logic 37 (1):55-68.
Manuel Blum. A Machine-independent theory of the complexity of recursive functions. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 322–336. [REVIEW]Manuel Blum - 1970 - Journal of Symbolic Logic 34 (4):657-658.
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-6686886f5-5pqs9 uwo