58 search results - page 1 / 12 » Almost Every Domain is Universal |
ENTCS
2007
13 years 4 months ago
2007
We endow the collection of ω-bifinite domains with the structure of a probability space, and we will show
CORR
2008
Springer
13 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 ...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
ISW
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a universally composable time-stamping scheme based on universal one-way hash functions. The model we use contains an ideal auditing functionality (implementab...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular pro...