Skip to search formSkip to main contentSkip to account menu

Grzegorczyk hierarchy

The Grzegorczyk hierarchy (pronounced: [ɡʐɛˈɡɔrt͡ʂɨk]), named after the Polish logician Andrzej Grzegorczyk, is a hierarchy of functions used in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Markov Chain Monte Carlo (MCMC) methods are a class of algorithms for sampling from a desired probability distribution. While… 
Review
2010
Review
2010
  • Qing Yan
  • 2010
  • Corpus ID: 6349555
Studies of complex biological systems aimed at understanding their functions at a global level are the goals of systems biology… 
2007
2007
Implantation of a cardiac pacemaker is a complicated procedure. The success of the procedure depends directly on the proper… 
Review
2004
Review
2004
computation theories are based on “programs” that use the basic operations and tests of the algebra only. They may have different… 
2003
2003
In this paper we are interested in a particular model of analog computation, the General Purpose Analog Computer (GPAC). In… 
1999
1999
Traditional results in subrecursion theory are integrated with the recent work in "predicative recursion" by defining a simple… 
1999
1999
We show how the charaterization of the polytime functions by Bellantoni and Cook [1] can be extended to characterize any stage of… 
1997
1997
In this paper, we give an extension of the Grzegorczyk Hierarchy to the BSS theory of computability which is a generalization of… 
Highly Cited
1972
Highly Cited
1972
It is well known that iteration of any number-theoretic function f, which grows at least exponentially, produces a new function f…