A Highly Random Number

&

Abstract

many symbols. We define o, as the probability that an arbitrary machine be circular and we prove that o, is a random number that goes beyond..

Categories

Add categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,337

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

The complexity of random ordered structures.Joel Spencer & Katherine St John - 2008 - Annals of Pure and Applied Logic 152 (1-3):174-179.
The complexity of random ordered structures.Joel H. Spencer & Katherine St John - 2008 - Annals of Pure and Applied Logic 152 (1):174-179.
On the largest eigenvalue of a sparse random subgraph of the hypercube.Soshnikov Alexander - unknown
Every computably enumerable random real is provably computably enumerable random.Cristian Calude & Nicholas Hay - 2009 - Logic Journal of the IGPL 17 (4):351-374.
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes.Stephen Cook, Cynthia Dwork & Rüdiger Reischuk - 1986 - SIAM Journal on Computing 15 (1):87–97.
Probabilistic events and physical reality: A complete algebra of probability.Paolo Rocchi & Leonida Gianfagna - unknown
The Kolmogorov complexity of random reals.Liang Yu, Decheng Ding & Rodney Downey - 2004 - Annals of Pure and Applied Logic 129 (1-3):163-180.
Every 2-random real is Kolmogorov random.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (3):907-913.
From index sets to randomness in ∅ n : random reals and possibly infinite computations. Part II.Verónica Becher & Serge Grigorieff - 2009 - Journal of Symbolic Logic 74 (1):124-156.

Analytics

Added to PP
2010-12-22

Downloads
4 (#1,803,034)

6 months
4 (#1,247,585)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.

Add more citations

References found in this work

No references found.

Add more references