A model with nondeterministic computation

  • Marisa Venturini Zilli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 37)


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.


Algorithmic Model Relative Predicate Sive Function Intuitive Consideration Operation Inside 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    WAGNER E.G., Uniformly Reflexive Structures: An Axiomatic Approach to Computability, Information Sci. 1 (1969), 343–362.Google Scholar
  2. [2]
    STRONG H.R., Algebraically Generalized Recursive Functions Theory, IBM J. Res. Develop.12 (1968), 465–475.Google Scholar
  3. [3]
    CURRY H.B. and FEYS R., Combinatory Logic, North Holland, Amsterdam, 1958.Google Scholar
  4. [4]
    GROSS W. and VENTURINI ZILLI M., Computability and Uniformly Reflexive Structures, Proceedings of the International Computing Symposium (Venice, 1972), pp.485–495.Google Scholar
  5. [5]
    VENTURINI ZILLI M., On different kinds of indefinite,Calcolo 11 (1974), 67–77.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Marisa Venturini Zilli
    • 1
  1. 1.Istituto per le Applicazioni del CalcoloC.N.R.Roma

Personalised recommendations