scientific article; zbMATH DE number 1390027

Publication date: 13 July 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

survey function algebra complexity classes computation model primitive recursive functions recursion scheme computable function quantifier hierarchies type 2 functional

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (27)

An analog characterization of the Grzegorczyk hierarchy ⋮ A feasible theory of truth over combinatory algebra ⋮ On the coincidence of complexity classes BPC and \(\text{TC}^0 \) ⋮ A Characterisation of the Relations Definable in Presburger Arithmetic ⋮ A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations ⋮ Pure Iteration and Periodicity ⋮ New substitution bases for complexity classes ⋮ Arithmetization of register machines with counters ⋮ Theories with self-application and computational complexity. ⋮ The Power of Non-determinism in Higher-Order Implicit Complexity ⋮ Continuous-time computation with restricted integration capabilities ⋮ A characterization of alternating log time by ramified recurrence ⋮ A survey of recursive analysis and Moore's notion of real computation ⋮ A proof-theoretic characterization of the basic feasible functionals ⋮ Bounded monotone recursion and multihead automata ⋮ Computations on counter machines with summator ⋮ Unbounded recursion and non-size-increasing functions ⋮ Unfolding Schematic Systems ⋮ Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) ⋮ Complexity Hierarchies beyond Elementary ⋮ A foundation for real recursive function theory ⋮ Separating NC along the \(\delta\) axis ⋮ On the computational complexity of imperative programming languages ⋮ Safe recursion with higher types and BCK-algebra ⋮ Implicit characterizations of FPTIME and NC revisited ⋮ A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations ⋮ Applicative theories for logarithmic complexity classes

This page was built for publication: