Abstract
The study of programs with finite development, i.e. programs that have every oriented path issuing from the initial node of finite length is of certain interest. Many naturally arising problems, e.g. problems of discrete optimization of limited dimension can be solved with the help of such programs /3/. Furthermore the limitation of the number of accomplished operations turns unspecified program into an object similar to the programs with finite development in their properties.
The present paper deals with the interrelation of two properties of programs: to be the program with finite development and to realize an everywhere definite function. The notions without definitions below refer to the 1-st order logic. Their definitions can be found in /1/.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ershov, Iu.L.; Paliutin, E.A. Mathematical logic. (Russian) "Nauka", Moscow, 1979.
Chang, C.C.; Keisler, H.J. Model theory. North-Holland, Amsterdam, 1973.
Moshkov, M.Iu. On the conditional tests. (Russian) Dokl. Akad. Nauk SSSR 265 (1982), no. 3, 550–552.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moshkov, M.I. (1987). On the Programs with finite development. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_69
Download citation
DOI: https://doi.org/10.1007/3-540-18740-5_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18740-0
Online ISBN: 978-3-540-48138-6
eBook Packages: Springer Book Archive