Rekursionszahlen und die Grzegorczyk-Hierarchie

DOI10.1007/BF01982053zbMath0213.01801MaRDI QIDQ5614654

Helmut Schwichtenberg

Publication date: 1969

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137821

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55)

Related Items (17)

Induction rules, reflection principles, and provably recursive functions ⋮ Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones ⋮ Unnamed Item ⋮ Ordinal recursive bounds for Higman's theorem ⋮ Unnamed Item ⋮ Complexity of algorithms and computations ⋮ On the computational power of automata with time or space bounded by Ackermann's or superexponential functions ⋮ Finitely stratified polymorphism ⋮ Subrecursive hierarchies on Scott domains ⋮ A classification of the one-argument primitive recursive functions ⋮ On primitive recursive wordfunctions ⋮ Control structures in programs and computational complexity ⋮ Function operators spanning the arithmetical and the polynomial hierarchy ⋮ A note on comparison of subrecursive hierarchies ⋮ On the computational complexity of imperative programming languages ⋮ A predicative and decidable characterization of the polynomial classes of languages ⋮ \({\mathcal M}^\omega\) considered as a programming language

Cites Work

• Unnamed Item
• Classes of recursive functions based on Ackermann's function
• Iteration of Primitive Recursion
• Computability of Recursive Functions

This page was built for publication: Rekursionszahlen und die Grzegorczyk-Hierarchie