11321 search results - page 1 / 2265 » Improvements to Turing's method |
MOC
2011
12 years 7 months ago
2011
Abstract. This article improves the estimate of the size of the definite integral of S(t), the argument of the Riemann zeta-function. The primary application of this improvement i...
TCS
2012
12 years 12 days ago
2012
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
FOCS
2006
IEEE
13 years 11 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...
ENTCS
2007
13 years 4 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
EUROGP
1999
Springer
13 years 9 months ago
1999
Springer
The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962. In this paper we propose an evolutionary approach to this problem. We will focus on the representati...