A difference in expressive power between flowcharts and recursion schemes

DOI10.1007/BF01776573MaRDI QIDQ3860819zbMATH OpenFDO

Authors Edward K. Blum, Nancy Lynch

Publication date 1979

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01776573

zbMATH Keywords

flowchartsrecursion schemes

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Cites work

• Relative complexity of algebras

Cited in

(6)

• Straight-line program length as a parameter for complexity analysis
• Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)
• Relative complexity of operations on numeric and bit-string algebras
• Relative complexity of algebras
• A difference in complexity between recursion and tail recursion
• Necessary and sufficient conditions for the universality of programming formalisms

This page was built for publication: A difference in expressive power between flowcharts and recursion schemes

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