AbstractThis note contains a proof that there is no recursive function of the initial index that gives a bound for the exceptional values in Blum speed-up, but that there is a recursive bounding function of the speed-up index. All the proofs given are constructive
Let h be any rapidly increasing function recursive in the halting problem. One can find a double rec...
We are concerned with programs for computing functions, and the running times of these programs as m...
AbstractStrong variants of the Operator Speed-up Theorem, Operator Gap Theorem and Compression Theor...
AbstractThis note contains a proof that there is no recursive function of the initial index that giv...
Blum’s speedup theorem is a major theorem in computational com-plexity, showing the existence of com...
ABSTRACT. This paper is concerned with the nature of speedups. Let f be any recursive func-tion. We ...
AbstractProblems of the effective synthesis of fastest programs (modulo a recursive factor) for recu...
AbstractRabin and Blum proved the existence of 0, 1-valued recursive functions which are arbitrarily...
AbstractIn the last years, recursive functions over the reals (Theoret. Comput. Sci. 162 (1996) 23) ...
AbstractIntuitively, a real number is recursive if we can get as accurate an approximation as we lik...
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory sho...
In this paper, the methods of recursive function theory are used to study the size (or cost or compl...
AbstractGiven a strictly increasing computable sequence (called a base sequence) of real numbers (wi...
AbstractThis article investigates algorithmic learning, in the limit, of correct programs for recurs...
Within the frameworks of learning in the limit of indexed classes of recursive languages from positi...
Let h be any rapidly increasing function recursive in the halting problem. One can find a double rec...
We are concerned with programs for computing functions, and the running times of these programs as m...
AbstractStrong variants of the Operator Speed-up Theorem, Operator Gap Theorem and Compression Theor...
AbstractThis note contains a proof that there is no recursive function of the initial index that giv...
Blum’s speedup theorem is a major theorem in computational com-plexity, showing the existence of com...
ABSTRACT. This paper is concerned with the nature of speedups. Let f be any recursive func-tion. We ...
AbstractProblems of the effective synthesis of fastest programs (modulo a recursive factor) for recu...
AbstractRabin and Blum proved the existence of 0, 1-valued recursive functions which are arbitrarily...
AbstractIn the last years, recursive functions over the reals (Theoret. Comput. Sci. 162 (1996) 23) ...
AbstractIntuitively, a real number is recursive if we can get as accurate an approximation as we lik...
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory sho...
In this paper, the methods of recursive function theory are used to study the size (or cost or compl...
AbstractGiven a strictly increasing computable sequence (called a base sequence) of real numbers (wi...
AbstractThis article investigates algorithmic learning, in the limit, of correct programs for recurs...
Within the frameworks of learning in the limit of indexed classes of recursive languages from positi...
Let h be any rapidly increasing function recursive in the halting problem. One can find a double rec...
We are concerned with programs for computing functions, and the running times of these programs as m...
AbstractStrong variants of the Operator Speed-up Theorem, Operator Gap Theorem and Compression Theor...
DOI
Add to ORKG