Lynch, Nancy A.; Blum, Edward K. A difference in expressive power between flowcharts and recursion schemes. (English) Zbl 0425.68020 Math. Syst. Theory 12, 205-211 (1979). We show the existence of a single interpretation for which no flowchart produces the same results as a particular recursion scheme. This review text is based on a scanned copy of the printed version. It was converted to LaTeX using MathPix and a specifically developed LLM to assign the text parts to the metadata. It may contain errors, misassignments, or gaps; in particular, the reviewer signature has not yet been extracted reliably in general. If you notice any errors, please report them directly to our editorial team via the Contact Form. Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 6 Documents MSC: 68Q60 Specification and verification (program logics, model checking, etc.) 68Q65 Abstract data types; algebraic specification Keywords:flowcharts; recursion schemes × Cite Format Result Cite Review PDF Full Text: DOI References: [1] M. Paterson and C. Hewitt, Comparative Schematology,MIT AI Lab Memo No. 201, Nov., 1970. [2] N. Lynch and E. K. Blum,Relative Complexity of Algebras, Submitted for publication. · Zbl 0473.68031 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.