1414 search results - page 7 / 283 » Randomness and Universal Machines |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
geometrical computation 4: small Turing universal signal machines J
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
The Bayesian framework is ideally suited for induction problems. The probability of observing xt at
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
STOC
2003
ACM
14 years 7 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...