1806 search results - page 1 / 362 » Randomness and halting probabilities |
JSYML
2006
13 years 7 months ago
2006
FUIN
2002
13 years 7 months ago
2002
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
FUIN
2007
13 years 7 months ago
2007
Using 1947 work of Post showing that the word problem for semigroups is unsolvable, we explicitly exhibit an algebraic characterization of the bits of the halting probability Ω....
EUROGP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...