scientific article; zbMATH DE number 3995650

MaRDI QIDQ4723716zbMATH OpenFDO

Authors Zsolt Szabo

Publication date 1986

zbMATH Keywords

loop-programshierarchy of primitive recursive word functionspolynomially computable word functionsShepherdson-Sturgis URM- machine with restrictions on loop-depth

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Recommendations

• Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
• scientific article; zbMATH DE number 806752
• On quasi-universal word functions
• A generalized Grzegorczyk hierarchy and low complexity classes
• Elementary functions and loop programs

Cited in

(6)

• On elementary word functions obtained by bounded prefix concatenation
• Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
• Bounded monotone recursion and multihead automata
• A hierarchy of loop programs over binary trees
• Elementary functions and loop programs
• A term rewriting characterization of the functions computable in polynomial space

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723716)