Time to reinspect the foundations?

Questioning if computer science is outgrowing its traditional foundations.

[1]  M. B. Pour-El,et al.  The wave equation with computable initial data such that its unique solution is not computable , 1981 .

[2]  Wilfried Sieg,et al.  Calculations by Man and Machine: Conceptual Analysis , 2000 .

[3]  Martin D. Davis.  The Myth of Hypercomputation , 2004 .

[4]  Giovanni Sommaruga,et al.  The Stored-Program Universal Computer: Did Zuse Anticipate Turing and von Neumann? , 2015 .

[5]  B. Copeland,et al.  Turing versus Godel on computability and the mind , 2013 .

[6]  B. Jack Copeland,et al.  Hypercomputation: philosophical issues , 2004, Theor. Comput. Sci..

[7]  Oron Shagrir,et al.  Physical Hypercomputation and the Church–Turing Thesis , 2003, Minds and Machines.

[8]  Peter Wegner,et al.  Computation beyond turing machines , 2003, CACM.

[9]  ShagrirOron,et al.  Physical Hypercomputation and the ChurchTuring Thesis , 2003 .

[10]  C. Teuscher,et al.  Alan Turing: Life and Legacy of a Great Thinker , 2004, Springer Berlin Heidelberg.

[11]  Andrea Sorbi,et al.  New Computational Paradigms: Changing Conceptions of What is Computable , 2007 .

[12]  Umesh Vazirani,et al.  Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics , 2012, 1206.3686.

[13]  Matthias Scheutz.  Narrow versus Wide Mechanism , 2003 .

[14]  Mahesh Viswanathan.  The Church-Turing Thesis , 2016 .

[15]  Robin Milner,et al.  Elements of interaction: Turing award lecture , 1993, CACM.

[16]  I. Pitowsky,et al.  The Physical Church Thesis and Physical Computational Complexity , 2013 .

[17]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[18]  Mike Stannett,et al.  X-machines and the halting problem: Building a super-turing machine , 1990, Formal Aspects of Computing.

[19]  Oded Goldreich,et al.  Computational complexity: a conceptual perspective , 2008, SIGA.

[20]  M. Hogarth.  Does general relativity allow an observer to view an eternity in a finite time? , 1992 .

[21]  Hajnal Andréka,et al.  Can General Relativistic Computers Break the Turing Barrier? , 2006, CiE.

[22]  Robin Gandy,et al.  Church's Thesis and Principles for Mechanisms , 1980 .

[23]  B. Jack Copeland,et al.  Narrow Versus Wide Mechanism: Including a Re-Examination of Turing’s Views on the Mind-Machine Issue , 2000 .

[24]  B. J. Copeland,et al.  Alan Turing’s Forgotten Ideas in Computer Science , 1999 .

[25]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[26]  István Németi,et al.  Non-Turing Computations Via Malament–Hogarth Space-Times , 2001 .