[Burgin, M. (2002). The Rise and Fall of Church-Turing Thesis. draft.]Search in Google Scholar
[Burgin, M. (2005). Super-Recursive Algorithms. Springer.]Search in Google Scholar
[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]Search in Google Scholar
[Copeland, J. (2008). The Mathematical Objection: Turing, Gödel and Penrose on the Mind. draft.]Search in Google Scholar
[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]Search in Google Scholar
[Copeland, J. and Sylvan, R. (1999). Beyond the universal Turing machine. Australasian Journal of Philosophy, 77(1):46–66.]Search in Google Scholar
[Davis, M. (2004). The myth of Hypercomputation. draft.10.1007/978-3-662-05642-4_8]Search in Google Scholar
[Davis, M. (2006). Why there is no such discipline as hypercomputation. Applied Mathematics and Computation, 178:4–7.]Search in Google Scholar
[Harel, D. (1992). Algorithmics. Pearson Education. In Polish: Harel, David, Rzecz o istocie informatyki. Algorytmika, WNT 2000.]Search in Google Scholar
[Hewitt, C. (2013). What is Computation? Actor Model versus Turing’s Model. draft.]Search in Google Scholar
[MacLennan, B. J. (2004). Natural computation and non-Turing models of computation. Theoretical Computer Science, 317:115–145.]Search in Google Scholar
[Murawski, R., editor (2014). Filozofia informatyki. Wydawnictwo Naukowe UAM.]Search in Google Scholar
[Odifreddi, P. (1989). Classical Recursion Theory. North-Holland Publishing Company.]Search in Google Scholar
[Ord, T. (2002). Hypercomputation: computing more than the Turing machine. draft.]Search in Google Scholar
[Ord, T. (2006). The many forms of hypercomputation. Applied Mathematics and Computation, 178:143–153.]Search in Google Scholar
[Shagrir, O. (2004). Super-tasks, accelerating Turing machines and uncomputability, Theoretical Computer Science, 317:105–114.10.1016/j.tcs.2003.12.007]Search in Google Scholar
[Shagrir, O. and Pitowsky, I. (2003). Physical Hypercomputation and the Church-Turing Thesis. Minds and Machines, 13:87–101.]Search in Google Scholar
[Spaan, E., Torenvliet, L., van Emde Boas, P. (1989). Nondeterminism, Fairness and a Fundamental Analogy, EACTS Bulletin, 37:186–193.]Search in Google Scholar
[Stannett, M. (2001). Hypercomputation is Experimentally Irrefutable, draft.]Search in Google Scholar
[Stannett, M. (2006). The case for hypercomputation, Applied Mathematics and Computation, 178:8–24.10.1016/j.amc.2005.09.067]Search in Google Scholar
[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.]Search in Google Scholar
[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]Search in Google Scholar