Abstract
Here we consider what it means for one programming system to be more succinct than another. This chapter introduces the various forms of relative succinctness examined in later chapters and establishes some basic facts about these notions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Royer, J.S., Case, J. (1994). Notions of Succinctness. In: Subrecursive Programming Systems. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0249-3_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0249-3_10
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6680-8
Online ISBN: 978-1-4612-0249-3
eBook Packages: Springer Book Archive