Abstract
The discovery discussed in this chapter is that of well-outlined and representative classes of algorithms. Representative means that for suitable aggregates X,Y the class contains an algorithm equivalent to (i.e. determining the same function as) any previously given X-Y-algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
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 computational 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_5
Download citation
DOI: https://doi.org/10.1007/978-94-015-8232-2_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4256-9
Online ISBN: 978-94-015-8232-2
eBook Packages: Springer Book Archive