S. Aaronson
Complexity Zoo website
http://complexityzoo.uwaterloo.ca/Complexity_Zoo
E. Blakey
2008
Factorizing RSA Keys, an Improved Analogue Solution
New Generation Computing
27
2
159–176
10.1007/s00354-008-0059-3
E. Blakey
2010
Beyond Blum: What is a Resource?
International Journal of Unconventional Computing
6
3-4
223–238
E. Blakey
2010
A Model-Independent Theory of Computational Complexity: From Patience to Precision and Beyond
University of Oxford
E. Blakey
2011
Unconventional Complexity Measures for Unconventional Computers
Natural Computing
10
4
1245–1259
10.1007/s11047-010-9226-9
A. Church
1936
An Unsolvable Problem of Elementary Number Theory
American Journal of Mathematics
58
345–363
10.2307/2371045
R. Gandy
1980
Church's Thesis and Principles of Mechanism
J. Barwise
H. J. Keisler
K. Kunen
The Kleene Symposium
Studies in Logic and the Foundations of Mathematics
101
North-Holland
123––148
10.1016/S0049-237X(08)71257-6
C. Papadimitriou
1995
Computational Complexity
Addison-Wesley
J. Reif
J. Tygar
Akitoshi Y.
1994
Computability and Complexity of Ray Tracing
Discrete and Computational Geometry
11
1
265–288
10.1007/BF02574009
M. Sipser
1997
Introduction to the Theory of Computation
PWS
S. Stepney
2008
The Neglected Pillar of Material Computation
Physica D: Nonlinear Phenomena
237
9
1157––1164
10.1016/j.physd.2008.01.028
A. Turing
1937
On Computable Numbers, with an Application to the Entscheidungsproblem
Proceedings of the London Mathematical Society
s2-42
1
230–265
10.1112/plms/s2-42.1.230