The honest subrecursive classes are a lattice
From MaRDI portal
Publication:4041560
DOI10.1016/S0019-9958(74)80039-2zbMath0291.02026MaRDI QIDQ4041560
Publication date: 1974
Published in: Information and Control (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items (12)
Reductions among polynomial isomorphism types ⋮ Streamlined subrecursive degree theory ⋮ Semi-honest subrecursive degrees and the collection rule in arithmetic ⋮ A maximal sequence of classes transformable by primitive recursion in a given class ⋮ On the structure of sets in NP and other complexity classes ⋮ Honest elementary degrees and degrees of relative provability without the cupping property ⋮ Augmented loop languages and classes of computable functions ⋮ Polynomial and abstract subrecursive classes ⋮ Minimal pairs of polynomial degrees with subexponential complexity ⋮ On the density of honest subrecursive classes ⋮ Some undecidability results for non-monadic Church-Rosser Thue systems ⋮ Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
This page was built for publication: The honest subrecursive classes are a lattice
