Abstract
We relate uniform and nonuniform models of computation on a semantical level. As a we use uniform model/a universal language based on recursive definitions over arbitrary data structures. Nonuniform models are represented by “term definitions” which describe functions by families of terms. We find the term definition inside a program, called calculation function, and show that exactly the recursive functions have recursive term definitions which can be realized as calculation functions. We give the examples of matrix multiplication and binary search to prove our concepts appropriate.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Büchi, J.R., Mahr, B., Siefkes, D., 1981: Forthcoming paper to appear
Karp, R.M., Lipton, R.J., 1980: Some Connections between Nonuniform and Unifor Complexity Classes. Proc. 12th ACM Symp. Theory of Computing, 302–309
Lynch, N., 1978: Straightline Program Length as a Parameter for Complexity Mea Proc. 10th ACM Symp. Theory of Computing, 150–161
Mahr, B., 1979: Algorithmische Komplexität des allgemeinen Wegeproblems in Gra Bericht Nr. 79–14, Informatik, Technische Univ. Berlin, 133 pp.
Post, E.L., 1936: Finite Combinatory Processes. J.SymbLogic 1, 103–105
Sasso, L.P., 1975: A survey of partial degrees. J.Symb. Logic 40, 130–140
Strassen, V., 1969: Gaussian elimination is not optimal. Numer. Math. 13, 354–356.
Strassen, V., 1972/73: Berechnung und Programm 1/2. Acta Informatica 1/2.
Siefkes, D., 1979: Recursive Equations as a Programming System. In: “Begriffsschrift” Jenaer Fregekonferenz, Jena, 433–448
Siefkes, D., 1980: Programming with Recursion. Tech. Report CSD-TR 331, Purdue University, 72 pp.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mahr, B., Siefkes, D. (1981). Relating Uniform and Nonuniform Models of Computation. In: Brauer, W. (eds) GI — 11. Jahrestagung. Informatik-Fachberichte, vol 50. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-01089-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-01089-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10884-9
Online ISBN: 978-3-662-01089-1
eBook Packages: Springer Book Archive