Abstract
In paragraph 2 of this paper an algorithmic model is described having a set R of rules. In paragraph 3 two new rules are added to the rules of R. Such new rules may change a nonterminating computation into a terminating one. In paragraph 4 some families of expressions to which the rules added to R can be applied are defined. In paragraph 5 it is shown that the considered model is a uniformly reflexive structure.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
WAGNER E.G., Uniformly Reflexive Structures: An Axiomatic Approach to Computability, Information Sci. 1 (1969), 343–362.
STRONG H.R., Algebraically Generalized Recursive Functions Theory, IBM J. Res. Develop.12 (1968), 465–475.
CURRY H.B. and FEYS R., Combinatory Logic, North Holland, Amsterdam, 1958.
GROSS W. and VENTURINI ZILLI M., Computability and Uniformly Reflexive Structures, Proceedings of the International Computing Symposium (Venice, 1972), pp.485–495.
VENTURINI ZILLI M., On different kinds of indefinite,Calcolo 11 (1974), 67–77.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zilli, M.V. (1975). A model with nondeterministic computation. In: Böhm, C. (eds) λ-Calculus and Computer Science Theory. LCCST 1975. Lecture Notes in Computer Science, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029532
Download citation
DOI: https://doi.org/10.1007/BFb0029532
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07416-8
Online ISBN: 978-3-540-37944-7
eBook Packages: Springer Book Archive