Abstract
A computer program is a finite sequence P = (K(1),...,K(N)) of labelled commands K(i)= 〈b(i),C(i)〉, where b(i) is a label and C(i) is a command (see e.g. [1]), such that b(i)≠b(j) if i≠ j.
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
References
K. Čulík: Structural similarity of programs and some concepts of algorithmic method, 249–280, Lecture Notes in Economics and Mathematical Systems 75, Springer 1972
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Čulík, K. (1973). Main Degrees of Complexity of Computer Programs and Computable Functions. In: Brauer, W. (eds) GI Gesellschaft für Informatik e. V.. Lecture Notes in Computer Science, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-41148-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-662-41148-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-40668-7
Online ISBN: 978-3-662-41148-3
eBook Packages: Springer Book Archive