14190 search results - page 177 / 2838 » computer 2008 |
123
click to vote
CORR
2008
Springer
15 years 4 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 ...
