A hierarchy of loop programs over binary trees

DOI10.1080/00207168608803501MaRDI QIDQ3802613zbMATH OpenOpenAlexFDO

Authors Emanuela Fachini, Margherita Napoli

Publication date 1986

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168608803501

zbMATH Keywords

complexity hierarchydecision problemsdepth of nestingloop programs over binary treesprimitive recursive functions

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Elementary functions and loop programs
• Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
• Self-monitoring machines and an \(\omega^ \omega\) hierarchy of loops
• scientific article; zbMATH DE number 3995650
• scientific article; zbMATH DE number 1696443

Cites work

• A Hierarchy of Primitive Recursive Functions
• Comparing Hierarchies of Primitive Recursive Sequence Functions
• Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
• On primitive recursive wordfunctions
• Tree correspondence problems

Cited in

(3)

• Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
• Elementary functions and loop programs
• Some Hierarchies of Primitive Recursive Functions on Term Algebras

This page was built for publication: A hierarchy of loop programs over binary trees

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