Affiliation:
1. Warsaw University of Technology , Faculty of Administration and Social Sciences, International Center for Formal Ontology
Abstract
Abstract
Analogicity in computer science is understood in two, not mutually exclusive ways: 1) with regard to the continuity feature (of data or computations), 2) with regard to the analogousness feature (i.e. similarity between certain natural processes and computations). Continuous computations are the subject of three methodological questions considered in the paper: 1a) to what extent do their theoretical models go beyond the model of the universal Turing machine (defining digital computations), 1b) is their computational power greater than that of the universal Turing machine, 1c) under what conditions are continuous computations realizable in practice? The analogue-analogical computations lead to two other issues: 2a) in what sense and to what extent their accuracy depends on the adequacy of certain theories of empirical sciences, 2b) are there analogue-analogical computations in nature that are also continuous? The above issues are an important element of the philosophical discussion on the limitations of contemporary computer science.
Reference32 articles.
1. Blum, L., Shub, M., & Smale, S. (1989). On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. (NS), 21, 1–46.
2. Cafe Aleph (http://blog.marciszewski.eu/). An academic discussion blog ran by W. Marciszewski and P. Stacewicz.
3. Chaitin, G. (2003). The Limits of Mathemathics. London: Springer-Verlag.
4. Costa, J. F., & Graça, D. (2003). Analog computers and recursive functions over the reals. Journal of Complexity, 19(5), 644–664.
5. Deutsch, D. (1985). Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. Lond A 400, 97–117.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献