Abstract
Here the discovery is the very possibility of giving the exact definition of a representative class of calculuses, i.e. a class containing a calculus eqivalent to any given calculus. (To be more exact we should speak not about representative but about Y-representative models. Assume that Y is an aggregate; a generating model is called Y-representative if for any calculus generating a subset of Y there exists a calculus of this model generating the same subset.) The notion of a generating model appears in the same way as the notion of a computational model.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Uspensky, V., Semenov, A. (1993). Representative generating models. In: Algorithms: Main Ideas and Applications. Mathematics and Its Applications, vol 251. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8232-2_7
Download citation
DOI: https://doi.org/10.1007/978-94-015-8232-2_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4256-9
Online ISBN: 978-94-015-8232-2
eBook Packages: Springer Book Archive