Analogicity in Computer Science. Methodological Analysis
References
- 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.10.1090/S0273-0979-1989-15750-9
- Cafe Aleph (http://blog.marciszewski.eu/). An academic discussion blog ran by W. Marciszewski and P. Stacewicz.
- Chaitin, G. (2003). The Limits of Mathemathics. London: Springer-Verlag.10.1007/978-1-4471-0015-7
- Costa, J. F., & Graça, D. (2003). Analog computers and recursive functions over the reals. Journal of Complexity, 19(5), 644–664.10.1016/S0885-064X(03)00034-7
- Deutsch, D. (1985). Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. Lond A 400, 97–117.10.1098/rspa.1985.0070
- Fichtenholz, G. M. (1997). Rachunek różniczkowy i całkowy (Differential and Integral Calculus), vol. 2. Warszawa: PWN.
- Harel, D. (1997). Algorithmics. The Spirit of Computing. Reading, Massachusetts: Addison-Wesley.
- Hogarth, M. (1994). Non-Turing computers and non-Turing computability. PSA 1, 126–138.10.1086/psaprocbienmeetp.1994.1.193018
- Ifrah, G. (2006). Historia powszechna cyfr (Universal History of Numbers), vol. 2. Warszawa: Wydawnictwo W.A.B.
- Kari, L., & Rozenberg, G. (2008). The many facets of natural computing. Communications of the ACM, 51(10), 72–83.10.1145/1400181.1400200
- Krajewski, W. (1998). Prawa nauki. Przegląd zagadnień metodologicznych i filozoficznych (Laws of Science. A Review of Methodological and Philosophical Issues). Warszawa: Książka i Wiedza.
- Kulka, Z., & Nadachowski, N. (1979). Analogowe układy scalone (Analogue Integrated Circuits). Warszawa: WKiŁ.
- Kulka, Z., & Nadachowski, N. (1982). Wzmacniacze operacyjne i ich zastosowanie (Operational Amplifiers and Their Applications). Warszawa: WKiŁ.
- Marciszewski, W. (2013). Racjonalistyczny optymizm poznawczy w Gödlowskiej wizji dynamiki wiedzy (Rationalistic Cognitive Optimism in Gödel’s Vision of Dynamics of Knowledge). In R. Ziemińska (Ed.), Przewodnik po epistemologii (A Companion to Epistemology) (pp. 423–456). Kraków: Wydawnictwo WAM.
- Marciszewski, W., & Stacewicz, P. (2011). Umysł – Komputer – Świat. O zagadce umysłu z informatycznego punktu widzenia (Mind – Computer – World. On the Riddle of the Mind from the Computational Point of View). Warszawa: Akademicka Oficyna Wydawnicza.
- Michalewicz, Z. (1992). Genetic Alghorithms + Data Structures = Evolution Programs. Berlin, Heidelberg: Springer-Verlag.10.1007/978-3-662-02830-8
- Moore, C. (1996). Recursion theory on the reals and continous-time computation. Theoretical Computer Science, 162, 23–44.10.1016/0304-3975(95)00248-0
- Mycka, J. (2010). Obliczenia dyskretne i ciągłe jako realizacje antropomorficznej i fizycznej koncepcji efektywnej obliczalności (Discrete and continuous computations as realisations of an anthropomorphic and physical concept of effective computability). In I. Bondecka-Krzykowska & J. Pogonowski (Eds.), Światy matematyki. Tworzenie czy odkrywanie? (The worlds of mathematics. Creating or discovering?) pp. 247–260). Poznań: Wydawnictwo Naukowe UAM.
- Mycka, J., & Piekarz, M. (2004). Przegląd zagadnień obliczalności analogowej (A Review of the Issues of Analog Computability). In S. Grzegórski, M. Miłosz, & P. Muryjas (Eds.), Algorytmy, metody i programy naukowe (Algorithms, Methods and Scientific Programmes) (pp. 125–132). Lublin: Polskie Towarzystwo Informatyczne.
- Pour-El, M. B. (1974). Abstract Computability and its Relations to the General Purpose Analog Computer. Transactions of the American Mathematical Society, 199, 1–28.
- Polak, P. (2016). Computing as Empirical Science-Evolution of a Concept. Studies in Logic, Grammar and Rhetoric, 48(1), 49–69.10.1515/slgr-2016-0055
- Rozenberg, G., Back, T., & Kok, J. N. (Eds.). (2012). Handbook of Natural Computing. Berlin-Heidelberg: Springer-Verlag.10.1007/978-3-540-92910-9
- Rubel, L. (1993). The extended analog computer. Advances in Applied Mathematics, 14, 39–50.10.1006/aama.1993.1003
- Shannon, C. (1941). Mathematical Theory of the Differential Analyzer. J. Math. Phys. MIT, 20, 337–354.10.1002/sapm1941201337
- Shagrir, O. (2004). Super-tasks, Accelerating Turing Machines and Uncomputability. Theoretical Computer Science, 317, 105–114.10.1016/j.tcs.2003.12.007
- Siegelmann, H. T. (1998). Neural Networks and Analog Computation: Beyond the Turing Limit. Boston: Birkhauser.
- Stacewicz, P. (2010). Umysł a modele maszyn uczących się, współczesne badania informatyczne w oczach filozofia (The Mind and Models of Learning Machines. Contemporary Computer Science Research from Philosopical Perspective). Warszawa: Akademicka Oficyna Wydawnicza.
- Stacewicz, P. (2017). O różnych sposobach rozumienia analogowości w informatyce (On Different Meanings of Analogicity in Computer Science). Semina Scientiarum, 16, 121–137.
- Stacewicz, P. (2019a). From Computer Science to the Informational Worldview. Philosophical Interpretations of Some Computer Science Concepts. Foundations of Computing & Decision Sciences, 44, 27–43.10.2478/fcds-2019-0003
- Stacewicz, P. (2019b). Uncomputable Numbers and the Limits of Coding in Computer Science. Studia Semiotyczne, 30, 107–127.
- Turing, A. M. (1950). Computing Machinery and Intelligence. Mind, 49, 433–460.10.1093/mind/LIX.236.433
- Turing, A. M. (1936). On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. Lond. Math. Soc., 42, 230–265.
Language: English
Page range: 69 - 86
Published on: Nov 4, 2020
Published by: University of Białystok, Department of Pedagogy and Psychology
In partnership with: Paradigm Publishing Services
Publication frequency: 4 times per year
Keywords:
Related subjects:
© 2020 Paweł Stacewicz, published by University of Białystok, Department of Pedagogy and Psychology
This work is licensed under the Creative Commons Attribution 4.0 License.