Abstract
Relations between such concepts as reducibility, universality, hardness, completeness, and deductibility are studied. The aim is to build a flexible and comprehensive theoretical foundations for different techniques and ideas used in computer science. It is demonstrated that: concepts of universality of algorithms and classes of algorithms are based on the construction of reduction of algorithms; concepts of hardness and completeness of problems are based on the construction of reduction of problems; all considered concepts of reduction, as well as deduction in logic are kinds of reduction of abstract properties. The Church-Turing Thesis, which states universality of the class of all Turing machines, is considered in a mathematical setting as a theorem proved under definite conditions.
Keywords
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
Baker, T., Gill, J., Solovey, R.: Relativizations of the P =? NP question. SIAM Journal of Computing 4, 431–442 (1975)
Bennett, C.N., Landauer, R.: On Fundamental Physical Limits of Computation. Scientific American 7, 48–56 (1985)
Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays. Academic Press, London (1982)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity of Real Computation. Springer, New York (1998)
Boker, U.: Comparing Computational Power. PhD thesis, Tel-Aviv University (2004)
Boker, U., Dershowitz, N.: A Formalization of the Church-Turing Thesis for State-Transition Models, http://www.cs.tau.ac.il/
Boker, U., Dershowitz, N.: How to Compare the Power of Computational Models. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 54–64. Springer, Heidelberg (2005)
Burgin, M.: Multiple computations and Kolmogorov complexity for such processes (translated from Russian). Notices of the Academy of Sciences of the USSR 269(4), 793–797 (1983)
Burgin, M.: Composition of operators in a multidimensional structured model of parallel computations and systems (translated from Russian). Cybernetics and System Analysis 19(3), 340–350 (1984)
Burgin, M.: Abstract Theory of Properties and Sociological Scaling (in Russian). Expert Evaluation in Sociological Studies. Kiev, 243–264 (1990)
Burgin, M.: Universal limit Turing machines (translated from Russian). Notices of the Russian Academy of Sciences 325(4), 654–658 (1992)
Burgin, M.: How We Know What Technology Can Do. Communications of the ACM 44(11), 82–88 (2001)
Burgin, M.: Superrecursive Algorithms. Springer, New York (2005)
Burgin, M.: Measuring Power of Algorithms, Programs, and Automata. In: Shannon, S. (ed.) Artificial Intelligence and Computer Science, pp. 1–61. Nova Science Publishers, New York (2005)
Burgin, M.S., Borodyanskii, Y.M.: Alphabetic Operators and Algorithms. Cybernetics and System Analysis 29(3), 42–57 (1993)
Burton, D.M.: The History of Mathematics. McGrow Hill Co., New York (1997)
Dreyfus, H.L.: What Computers Can’t Do - The Limits of Artificial Intelligence. Harper and Row (1979)
Eberbach, E., Goldin, D., Wegner, P.: Turing’s Ideas and Models of Computation. In: Teuscher, C. (ed.) Alan Turing: Life and Legacy of a Great Thinker, pp. 159–194. Springer, Heidelberg (2004)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Boston, San Francisco, New York (2001)
Lewis, J.P.: Limits to Software Estimation. Software Engineering Notes 26(4), 54–59 (2001)
Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and its Applications. Springer, New York (1997)
Malcev, A.I.: Algorithms and Recursive Functions (in Russian), Nauka, Moscow (1965)
Markov, A.A.: Theory of Algorithms (in Russian). Transactions of the Mathematical Institute of the Academy of Sciences of the USSR 42 (1954)
Rogers, H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, Massachusetts (1987)
Rubel, L.A.: Some Mathematical Limitations of the General-Purpose Analog Computer. Advances in Applied Mathematics 9, 22–34 (1988)
Shoenfield, J.R.: Mathematical Logic. Addison-Wesley, Reading, Mass (1967)
Turing, A.M.: Can digital computers think?. Machine Intelligence, 15, Oxford University Press, Oxford (1951, 1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burgin, M. (2007). Universality, Reducibility, and Completeness. In: Durand-Lose, J., Margenstern, M. (eds) Machines, Computations, and Universality. MCU 2007. Lecture Notes in Computer Science, vol 4664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74593-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-74593-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74592-1
Online ISBN: 978-3-540-74593-8
eBook Packages: Computer ScienceComputer Science (R0)