CIE
2008
Springer
13 years 6 months ago
2008
Springer
CIE
2008
Springer
13 years 6 months ago
2008
Springer
CIE
2008
Springer
13 years 6 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
CIE
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor step...
CIE
2008
Springer
13 years 6 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
CIE
2008
Springer
13 years 6 months ago
2008
Springer
The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF, building on a previous mechanization of the reflection theorem. The heavy relia...
CIE
2008
Springer
13 years 6 months ago
2008
Springer
Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet that satisfy some given condition P on the asympt...
CIE
2008
Springer
13 years 6 months ago
2008
Springer
CIE
2008
Springer
13 years 6 months ago
2008
Springer
CIE
2008
Springer
13 years 6 months ago
2008
Springer
