Is Church’s Thesis Still Relevant?
By:
References
- Burgin, M. (2002). The Rise and Fall of Church-Turing Thesis. draft.
- Burgin, M. (2005). Super-Recursive Algorithms. Springer.
- Chaitin, G. J. (2006). The Omega Number: Irreducible Complexity in Pure Math. In Borwein, J. M. and Farmer, W. M., editors, Mathematical Knowledge Management, 5th International Conference, Wokingham, UK, volume 4108 of Lecture Notes in Computer Science. Springer.10.1007/11812289_1
- Copeland, J. (2008). The Mathematical Objection: Turing, Gödel and Penrose on the Mind. draft.
- Copeland, J. and Shagrir, O. (2007). Physical Computation: How General are Gandy’s Principles for Mechanism? Minds and Machines, 17:217–231.10.1007/s11023-007-9058-2
- Copeland, J. and Sylvan, R. (1999). Beyond the universal Turing machine. Australasian Journal of Philosophy, 77(1):46–66.
- Davis, M. (2004). The myth of Hypercomputation. draft.10.1007/978-3-662-05642-4_8
- Davis, M. (2006). Why there is no such discipline as hypercomputation. Applied Mathematics and Computation, 178:4–7.
- Harel, D. (1992). Algorithmics. Pearson Education. In Polish: Harel, David, Rzecz o istocie informatyki. Algorytmika, WNT 2000.
- Hewitt, C. (2013). What is Computation? Actor Model versus Turing’s Model. draft.
- MacLennan, B. J. (2004). Natural computation and non-Turing models of computation. Theoretical Computer Science, 317:115–145.
- Murawski, R., editor (2014). Filozofia informatyki. Wydawnictwo Naukowe UAM.
- Odifreddi, P. (1989). Classical Recursion Theory. North-Holland Publishing Company.
- Ord, T. (2002). Hypercomputation: computing more than the Turing machine. draft.
- Ord, T. (2006). The many forms of hypercomputation. Applied Mathematics and Computation, 178:143–153.
- Shagrir, O. (2004). Super-tasks, accelerating Turing machines and uncomputability, Theoretical Computer Science, 317:105–114.10.1016/j.tcs.2003.12.007
- Shagrir, O. and Pitowsky, I. (2003). Physical Hypercomputation and the Church-Turing Thesis. Minds and Machines, 13:87–101.
- Spaan, E., Torenvliet, L., van Emde Boas, P. (1989). Nondeterminism, Fairness and a Fundamental Analogy, EACTS Bulletin, 37:186–193.
- Stannett, M. (2001). Hypercomputation is Experimentally Irrefutable, draft.
- Stannett, M. (2006). The case for hypercomputation, Applied Mathematics and Computation, 178:8–24.10.1016/j.amc.2005.09.067
- Turing, A. (1986). In Carpenter, B. E. and Doran, R. W., editors, A. M. Turing’s ACE report of 1946 and other papers, chapter Lecture to the London Mathematical Society on 20 February 1947. MIT Press.
- Zenil, H. (2012). In Zenil, H., editor, A Computable Universe. Understanding and Exploring Nature as Computation, chapter ntroducing the Computable Universe. World Scientific Publishing Company.10.1142/8306
Language: English
Page range: 31 - 51
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
Related subjects:
© 2020 Jerzy Mycka, Adam Olszewski, published by University of Białystok, Department of Pedagogy and Psychology
This work is licensed under the Creative Commons Attribution 4.0 License.