GREEN, M.W. A lower bound on Rado's sigma function for binary Turing machines. Switching Circuit Theory and Logical Design, IEEE Pub. S-164, 1964, pp. 91-94.

Google Scholar

[7]

HARTMANIS, J., AND STEARNS, ~:~. E. On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117 (May 1965), 285-306.

Google Scholar

[8]

KOLMOGOROV, A. N. Grundbegriffe der Wahrscheinlichkeitsrechnung. Springer, Berlin, 1933; translated, ed., Foundations of the Theory of Probability, Morrison, Nathan, transl., Chelsea, New York, 1956.

Google Scholar

[9]

----. On tables of random numbers. Sankhyd. The Indian Journal of Statistics {A}, 25, 4 (1963), 369-376.

Google Scholar

[10]

----. Three approaches to the quantitative definition of information. Inform. Transmission 1 (1965), 3-11.

Google Scholar

[11]

, ----. Logical basis for information theory and probability theory. IEEE Trans. IT-14, 5 (Sept. 1968), 662-664.

Google Scholar

[12]

MARTIN-LoF, P. The definition of random sequences. Inform. Control 9 (1966), 602-619.

Google Scholar

[13]

MINSKY, M. L. Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs, N. J., 1967.

Crossref

Google Scholar

[14]

RITCHIE, R.W. Classes of predictably computable functions. Trans. Amer. Math. Soc. 106 (1963), 139-173.

Google Scholar

[15]

RUSSELL, B. A.W. Les paradoxes de la logique. Revue de M~taphysique el de Morale 14 (1906), 627-650.

Google Scholar

[16]

SHANNON, C.E. A mathematical theory of communication. Bell Syst. Tech. J. 27 (1948), 379-423.

Google Scholar

[17]

--. A universal Turing machine with two internal states. In Automata Studies, Shannon, C. E., and McCarthy, J. (Eds.), Princeton U. Press, Princeton, N. J., 1956, pp. 157-165.

Google Scholar

[18]

SOLOMONOFF, R. J. A formal theory of inductive inference, Pt. I. Inform. Control. 7 (1964), 1-22.

Google Scholar

[19]

STEARNS, R. E., HARTMANIS, J., AND LEWIS, P.M. Hierarchies of memory limited computations. IEEE Conf. Rec. on Switching Circuit Theory and Logical Design, IEEE Pub. 16C13, 1965, 179-190.

Google Scholar

[20]

TURING, A.M. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. {2}, 42 (1936-1937), 230-265; correction in Proc. London Math. Soc. {2}, 43 (1937), 544-546.

Google Scholar

[21]

VON MISES R. Probability, Statistics and Truth. William Hodge, London, 1939.

Google Scholar

[22]

WILLIS, D. G. The Mechanism of Inductive Inference. Stanford U., Stanford, Calif., June 3, 1968.

Google Scholar

Cited By

View all

Monk JMycielski JSchmidt J(2014)Meeting of the Association for Symbolic Logic, Dallas 1973The Journal of Symbolic Logic10.2307/227308938:03(541-549)Online publication date: 12-Mar-2014
https://doi.org/10.2307/2273089
Gács P(2014)ComplexityWiley StatsRef: Statistics Reference Online10.1002/9781118445112.stat02992Online publication date: 29-Sep-2014
https://doi.org/10.1002/9781118445112.stat02992
Svozil K(2013)BACK MATTERRandomness and Undecidability in Physics10.1142/9789814503563_bmatter(243-292)Online publication date: 12-May-2013
https://doi.org/10.1142/9789814503563_bmatter
Show More Cited By

Index Terms

Computational Complexity and Probability Constructions
1. Theory of computation
  1. Logic
  2. Models of computation
    1. Probabilistic computation

Recommendations

Kolmogorov Complexity and Computational Complexity
Computational complexity simplified
MATH'08: Proceedings of the American Conference on Applied Mathematics

There exists a variety of techniques for the computational complexity analysis of algorithms and functions. This analysis is imperative to the algorithmic and the functional performance. Besides the big-oh complexity, there are other complexity ...
An overview of computational complexity

An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 17, Issue 2

April 1970

200 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321574

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1970

Published in JACM Volume 17, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

35
Total Citations
View Citations
607
Total Downloads

Downloads (Last 12 months)65
Downloads (Last 6 weeks)13

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Monk JMycielski JSchmidt J(2014)Meeting of the Association for Symbolic Logic, Dallas 1973The Journal of Symbolic Logic10.2307/227308938:03(541-549)Online publication date: 12-Mar-2014
https://doi.org/10.2307/2273089
Gács P(2014)ComplexityWiley StatsRef: Statistics Reference Online10.1002/9781118445112.stat02992Online publication date: 29-Sep-2014
https://doi.org/10.1002/9781118445112.stat02992
Svozil K(2013)BACK MATTERRandomness and Undecidability in Physics10.1142/9789814503563_bmatter(243-292)Online publication date: 12-May-2013
https://doi.org/10.1142/9789814503563_bmatter
Carsetti ACarsetti A(2013)Randomness, Semantic Information and Limitation ProceduresEpistemic Complexity and Knowledge Construction10.1007/978-94-007-6013-4_3(49-80)Online publication date: 2-Feb-2013
https://doi.org/10.1007/978-94-007-6013-4_3
Solomonoff R(2008)Three Kinds of Probabilistic Induction: Universal Distributions and Convergence TheoremsThe Computer Journal10.1093/comjnl/bxm12051:5(566-570)Online publication date: 27-Feb-2008
https://doi.org/10.1093/comjnl/bxm120
Barnett V(2008)ReferencesComparative Statistical Inference10.1002/9780470316955.refs(337-364)Online publication date: 27-May-2008
https://doi.org/10.1002/9780470316955.refs
GAINES B(2007)SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITYInternational Journal of General Systems10.1080/030810777089347593:3(145-174)Online publication date: 6-Apr-2007
https://doi.org/10.1080/03081077708934759
Solomonoff R(2006)Complexity-based induction systemsIEEE Transactions on Information Theory10.1109/TIT.1978.105591324:4(422-432)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.1109/TIT.1978.1055913
Gács P(2006)ComplexityEncyclopedia of Statistical Sciences10.1002/0471667196.ess2174.pub2Online publication date: 15-Aug-2006
https://doi.org/10.1002/0471667196.ess2174.pub2
Solomonoff R(2005)The discovery of algorithmic probability: A guide for the programming of true creativityComputational Learning Theory10.1007/3-540-59119-2_165(1-22)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-59119-2_165
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Kolmogorov Complexity and Computational Complexity

Computational complexity simplified

An overview of computational complexity

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations