3575 search results - page 1 / 715 » Presentations of computably enumerable reals |
TCS
2002
13 years 10 months ago
2002
We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefix-free set of binary strings.
CORR
2008
Springer
13 years 11 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 ...
JCSS
2007
13 years 10 months ago
2007
We show that the elementary theory of the structure of the Solovay degrees of computably enumerable reals is undecidable.
APAL
2010
13 years 11 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
COMAD
2009
13 years 12 months ago
2009
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...