AbstractGrzegorczyk (1953) defines a recursive hierarchy fi(x). The diagonal function fx(x) majorizes every primitive recursive function and gives an example of an effectively computable, nonprimitive recursive function. An iterative algorithm is presented which computes fti(x). It has O(i) space complexity and O(i·fi(x)) time complexity, each of which is significantly better than the corresponding algorithm implemented directly from the recursive definition of the function
none1noWe address computational complexity writing polymorphic functions between finite types (i.e.,...
Proofs in an arithmetic system are ranked according to a ramification hierarchy based on occurrences...
AbstractWe consider the real sequences in I=[0,1) and real functions on I. A computability notion wi...
AbstractGrzegorczyk (1953) defines a recursive hierarchy fi(x). The diagonal function fx(x) majorize...
Starting from the definitions of predicative recursion and constructive diagonalization, we recall o...
AbstractThis paper deals with the computability in analysis within the framework of Grzegorczyk's hi...
AbstractWe study a restricted version of Shannon's general purpose analog computer in which we only ...
By means of the definition of predicative recursion, we introduce a programming language that provid...
AbstractThe basic motivation behind this work is to tie together various computational complexity cl...
AbstractWe establish linear lower bounds for the complexity of non-trivial, primitive recursive algo...
AbstractThe Ackermann function is defined recursively by A(0,n)=n + 1; A(i,0) = A(i - 1, 1) for i>0;...
AbstractWe define a class of recursive functions on the reals analogous to the classical recursive f...
International audiencePredicative analysis of recursion schema is a method to characterize complexit...
In the paper some aspects of complexity of R-recursive functions are considered. The limit hierarchy...
AbstractHigher type primitive recursive definitions (also known as Gödel's system T) defining first-...
none1noWe address computational complexity writing polymorphic functions between finite types (i.e.,...
Proofs in an arithmetic system are ranked according to a ramification hierarchy based on occurrences...
AbstractWe consider the real sequences in I=[0,1) and real functions on I. A computability notion wi...
AbstractGrzegorczyk (1953) defines a recursive hierarchy fi(x). The diagonal function fx(x) majorize...
Starting from the definitions of predicative recursion and constructive diagonalization, we recall o...
AbstractThis paper deals with the computability in analysis within the framework of Grzegorczyk's hi...
AbstractWe study a restricted version of Shannon's general purpose analog computer in which we only ...
By means of the definition of predicative recursion, we introduce a programming language that provid...
AbstractThe basic motivation behind this work is to tie together various computational complexity cl...
AbstractWe establish linear lower bounds for the complexity of non-trivial, primitive recursive algo...
AbstractThe Ackermann function is defined recursively by A(0,n)=n + 1; A(i,0) = A(i - 1, 1) for i>0;...
AbstractWe define a class of recursive functions on the reals analogous to the classical recursive f...
International audiencePredicative analysis of recursion schema is a method to characterize complexit...
In the paper some aspects of complexity of R-recursive functions are considered. The limit hierarchy...
AbstractHigher type primitive recursive definitions (also known as Gödel's system T) defining first-...
none1noWe address computational complexity writing polymorphic functions between finite types (i.e.,...
Proofs in an arithmetic system are ranked according to a ramification hierarchy based on occurrences...
AbstractWe consider the real sequences in I=[0,1) and real functions on I. A computability notion wi...
DOI
Add to ORKG