Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A difference in expressive power between flowcharts and recursion schemes

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

We show the existence of a single interpretation for which no flowchart produces the same results as a particular recursion scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

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.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Partially supported by NSF Grant MCS77-15628.

Partially supported by NSF Grant DCR75-02373.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lynch, N.A., Blum, E.K. A difference in expressive power between flowcharts and recursion schemes. Math. Systems Theory 12, 205–211 (1978). https://doi.org/10.1007/BF01776573

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01776573

Keywords