@PREAMBLE{"\newcommand{\Url}[1]{$\langle$http://#1$\rangle$} "
        # "\newcommand{\Online}[1]{\Url{#1}} "
        # "\newcommand{\TwoOnline}[2]{\Url{#1}, \Url{#2}} "}

@STRING{Springer = "Springer-Verlag"}
@STRING{BullAMS = "Bull. American Mathematical Society"}
@STRING{BullLMS = "Bull. London Mathematical Society"}
@STRING{BJPS = "British Journal for the Philosophy of Science"}
@STRING{TCS = "Theoretical Computer Science"}
@STRING{OUP = "Oxford University Press"}
@STRING{MAM = "Minds and Machines"}
@STRING{DCS = "Dept of Computer Science, Sheffield University, UK"}
@STRING{Wiley = "John Wiley"}


@article{Aberth68,
 author = {O. Aberth}, year = 1968,
 title = {{Analysis in the Computable Number Field}},
 journal = {J. ACM},
 volume = 15,
 pages = {275--299}
}

@inproceedings{Abramson71,
 author = {F.G. Abramson}, year = 1971,
 title = {{Effective Computation over the Real Numbers}},
 booktitle = {{Twelfth Annual IEEE Symposium on Switching and Automata Theory}},
 address = {Northridge, CA}
}

@article{Ambrose35a,
 author = {A. Ambrose}, year = 1935,
 title = {{Finitism in Mathematics I}},
 journal = {Mind},
 volume = 35,
 pages = {186--203}
}

@article{Ambrose35b,
 author = {A. Ambrose}, year = 1935,
 title = {{Finitism in Mathematics II}},
 journal = {Mind},
 volume = 35,
 pages = {317--340}
}

@article{Bains03,
 author = {S. Bains}, year = 2003,
 title = {{Intelligence as Physical Computation}},
 journal = {AISB Journal}
 volume = 1, number = 3, month = Jul, pages = {225--240}
}

@book{Ballard97,
 author = {D.H.	Ballard}, year = 1997,
 title = {{An Introduction to Natural Computation}},
 address = {Cambridge, MA},
 publisher = {MIT Press}
}

@article{Benioff80,
 author = {P. Benioff}, year = 1980,
 title = {{The Computer as a Physical System: A Microscopic Quantum Mechanical Hamiltonian Model of Computers as Represented by Turing Machines}},
 journal = {J. Statistical Physics},
 volume = 22, pages = {563--591}
}

@article{Bennett93,
 author = {C.H. Bennett}, year = 1993,
 title = {{Teleporting an Unknown Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels}},
 journal = {Physics Review Letters},
 volume = 70, pages = {1895--1898}
}

@article{Bennett95,
 author = {C.H. Bennett}, year = 1995,
 title = {{Quantum Information and Computation}},
 journal = {Physics Today},
 volume = 48, number = 10, pages = {24--30}
}

@article{BGS97,
 author = {J.L. Balc{\`a}zar and R. Gavald{\`a} and H.T. Siegelmann},
 year = 1997,
 title = {{Computational Power of Neural Networks: A Characterization in Terms of Kolmogorov Complexity}},
 journal = {IEEE Trans. on Information Theory},
 volume = 43, number = 4, pages = {1175--1183}
}

@inproceedings{BJ00,
 author = {S. Bains and J. Johnson}, year = 2000,
 title = {{Noise, physics and non-Turing computation}},
 booktitle = {{Joint Conference on Information Systems}},
 address = {Atlantic City},
 month = {28 Feb-3 Mar},
 note = {\Online{citeseer.nj.nec.com/298231.html}}
}

@article{Blake26,
 author = {R.M. Blake}, year = 1926,
 title = {{The Paradox of Temporal Process}},
 journal = {J. Philosophy},
 volume = 23, pages = {645--654}
}

@book{BCSS98,
 author = {L. Blum and F. Cucker and M. Shub and S. Smale}, year = 1998,
 title = {{Complexity and Real Computation}},
 address = {New York}, publisher = Springer
}

@article{BSS89,
 author = {L. Blum and M. Shub and S. Smale}, year = 1989,
 title = {{On a Theory of Computation and Complexity over the Real Numbers: NP-Completeness, Recursive Functions and Universal Machines}},
 journal = BullAMS,
 volume = 21, pages = {1--46}
}

@article{Boothroyd01,
 author = {D. Boothroyd}, year = {Tuesday 12 June 2001},
 title = {{Beyond Computing}},
 journal = {New Electronics},
 volume = 34, number = 11, pages = {16--18}
}

@incollection{WB97,
 author = {T. Ward and S. Bringsjord}, year = 1997,
 title = {{An Argument for the Uncomputability of Infinitary Mathematical Expertise}},
 editor = {P. Feltovitch and K. Ford and R. Hoffman},
 booktitle = {{Expertise in Context}},
 publisher = {AAAI Press}
}

@article{BA04,
 author = {S. Bringsjord and K. Arkoudas}, year = 2004,
 title = {{The modal argument for hypercomputing minds}},
 journal = TCS,
 volume = 317, pages = {167--190}
}

@article{BZ02,
 author = {S. Bringsjord and M. Zenzen}, year = 2002,
 title = {{Toward a Formal Philosophy of Hypercomputation}},
 journal = MAM,
 volume = 12, pages = {241--258}
}

@article{Burgin04,
 author={M. Burgin},
 title = {{Algorithmic complexity of recursive and inductive algorithms}},
 journal = TCS,
 volume = 317, pages = {31--60},
 year = 2004
}

@article{BK04a,
 author={M. Burgin and A. Klinger},
 title = {{Experience, generations, and limits in machine learning}},
 journal = TCS,
 volume = 317, pages = {71--91},
 year = 2004
}

@article{BK04b,
 author = {M. Burgin and A. Klinger},
 title = {{Three aspects of super-recursive algorithms and hypercomputation or finding black swans}},
 journal = TCS,
 volume = 317, pages = {1-11},
 year = 2004
}

@article{Bush31,
 author = {V. Bush}, year = 1931,
 title = {{The Differential Analyser: A New Machine for Solving Differential Equations}},
 journal = {J. Franklin Institute},
 volume = 212, pages = {447--488}
}

@article{Bush36,
 author = {V. Bush}, year = 1936,
 title = {{Instrumental Analysis}},
 journal = BullAMS,
 volume = 42, pages = {649--669}
}

@article{BC45,
 author = {V. Bush and S.H. Caldwell}, year = 1945,
 title = {{A New Type of Differential Analyser}},
 journal = {J. Franklin Institute},
 volume = 240, pages = {255--326}
}

@article{Calude02,
 author = {C.S. Calude}, year = 2002,
 title = {{Incompleteness, Complexity, Randomness and Beyond}},
 journal = MAM,
 volume = 12, pages = {503-–517}
}

@article{Campagnolo04,
 author={M.L. Campagnolo},
 title = {{Continuous-time computation with restricted integration capabilities}},
 journal = TCS,
 volume = 317, pages = {147--165},
 year = 2004
}

@article{Church36,
 author = {A. Church}, year = 1936,
 title = {{An Unsolvable Problem of Elementary Number Theory}},
 journal = {Amer. J. Math.},
 volume = 58, pages = {345--363}
}

@article{Church40,
 author = {A. Church}, year = 1940,
 title = {{On the Concept of a Random Sequence}},
 journal = BullAMS,
 volume = 46, pages = {130--135}
}

@article{CC90,
 author = {P.M. Churchland and P.S. Churchland}, year=1990,
 title = {{Could a Machine Think?}},
 journal = {Scientific American},
 volume = 262, number = 1, pages = {26--31}
}

@article{Cleland93,
 author = {C.E. Cleland}, year = 1993,
 title = {{Is the Church-Turing Thesis True?}},
 journal = MAM, volume = 3, pages = {283--312}
}

@article{Cleland02,
 author = {C.E. Cleland}, year = 2002,
 title = {{On Effective Procedures}},
 journal = MAM, volume = 12, pages = {159-–179}
}

@article{Cleland04,
 author={C.E. Cleland},
 title = {{The concept of computability}},
 journal = TCS,
 volume = 317, pages = {209--225},
 year = 2004
}

@article{dCD91,
 author = {N.C.A. da Costa and F.A. Doria},year = 1991,
 title = {{Classical Physics and Penrose’s Thesis}},
 journal = {Foundations of Physics Letters},
 volume = 4, pages = {363--374}
}

@article{Copeland40,
 author = {A.H. Copeland},year = 1940,
 title = {{Review of \cite{Church40}}},
 journal = {J. Symbolic Logic},
 volume = 5, number = 2, pages = {71--72}
}

@article{Copeland97,
 author = {B.J. Copeland}, year = 1997,
 title = {{The Broad Conception of Computation}},
 journal = {American Behavioral Scientist},
 volume = 40, pages = {690--716}
}

@article{Copeland98a,
 author = {B.J. Copeland}, year = 1998,
 title = {{Super Turing-Machines}},
 journal = {Complexity},
 volume = 4, pages = {30--32}
}

@article{Copeland98b,
 author = {B.J. Copeland}, year = 1998,
 title = {{Turing's O-Machines, Penrose, Searle and the Brain}},
 journal = {Analysis}, volume = 58, pages = {128--138}
}

@incollection{Copland98c,
 author = {B.J. Copeland}, year = 1998,
 title = {{Even Turing Machines Can Compute Uncomputable Functions}},
 editor = {C. Calude and J. Casti and M. Dinneen},
 booktitle = {{Unconventional Models of Computation}},
 address = {London}, publisher = Springer, pages = {150--164}
}

@article{Copeland00,
 author = {B.J. Copeland}, year = 2000,
 title = {{Narrow versus Wide Mechanism}},
 journal = {Journal of Philosophy}, volume = 96, pages = {5--32}
}

@incollection{Copeland01,
 author = {B.J. Copeland}, year = 2001,
 title = {{Modern History of Computing}},
 editor = {E. Zalta},
 note = {\Online{plato.stanford.edu/}},
 booktitle = {{The Stanford Encyclopaedia of Philosophy}}
}

@article{Copeland02a,
 author = {B.J. Copeland}, year = 2002,
 title = {{Accelerating Turing Machines}},
 journal = MAM,
 volume = 12, pages = {281--301}
}

@article{Copeland02b,
 author = {B.J. Copeland}, year = 2002,
 title = {{Hypercomputation}},
 journal = MAM,
 volume = 12, pages = {461--502}
}

@article{Copeland04,
 author={B.J. Copeland},
 title = {{Hypercomputation: philosophical issues}},
 journal = TCS,
 volume = 317, pages = {251--267},
 year = 2004
}

@article{CP99a,
 author = {B.J. Copeland and D. Proudfoot}, year = 1999,
 title = {{Alan Turing's Forgotten Ideas in Computer Science}},
 journal = {Scientific American},
 volume = 280, month = Apr, pages = {99--103}
}

@article{CP99b,
 author = {B.J. Copeland and D. Proudfoot}, year = 1999,
 title = {{The Legacy of Alan Turing}},
 journal = {Mind}, volume = 108, pages = {187--195}
}

@article{CP00,
 author = {B.J. Copeland and D. Proudfoot}, year = 2000,
 title = {{What Turing did after he Invented the Universal Turing Machine}},
 journal = {Journal of Logic, Language, and Information}, pages = {1--19}
}

@article{CS99,
 author = {B.J. Copeland and R. Sylvan}, year = 1999,
 title = {{Beyond the Universal Turing Machine}},
 journal = {Australasian Journal of Philosophy},
 volume = 77, pages = {46--66}
}

@article{Cotogno03,
 author = {P. Cotogno}, year = 2003,
 title = {{Hypercomputation and the Physical Church-Turing Thesis}},
 journal = BJPS, volume = 54, pages = {181--223}
}

@article{Davies01,
 author = {E.B. Davies}, year = 2001,
 title = {{Building Infinite Machines}},
 journal = BJPS, volume = 52, number = 4, pages = {671--682}
}

@book{Davis58,
 author = {M. Davis}, year = 1958,
 title = {{Computability and Unsolvability}},
 address = {New York}, publisher = {McGraw-Hill}
}

@incollection{Davis04,
 author = {M. Davis}, year = 2004,
 title = {{The Myth of Hypercomputation}},
 editor = {C. Teuscher}, year = 2004,
 booktitle = {{Alan Turing: Life and Legacy of a Great Thinker}},
 address = {Berlin}, publisher = Springer,
 pages = {195--211}
}

@article{Deutsch85,
 author = {D. Deutsch}, year = 1985,
 title = {{Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer}},
 journal = {Proc. Royal Society, Series A},
 volume = 400, pages = {97--117}
}

@techreport{Doyle82,
 author = {J. Doyle}, year = 1982,
 title = {{What is Church's Thesis? An Outline}},
 institution = {Laboratory for Computer Science, MIT}
}

@article{Doyle02,
 author = {J. Doyle}, year = 2002,
 title = {{What is Church’s Thesis? An Outline}},
 journal = MAM,
 volume = 12, pages = {519-–520}
}

@book{Dreyfus79,
 author = {H.L. Dreyfus}, year = 1979,
 title = {{What Computers Can't Do: The Limits of Artificial Intelligence}},
 address = {New York, NY},
 publisher = {Harper \& Row},
 edition = {Revised}
}

@book{Dreyfus92,
 author = {H.L. Dreyfus}, year = 1992,
 title = {{What Computers Still Can't Do: A Critique of Artificial Reason}},
 address = {Cambridge, MA},
 publisher = {MIT Press}
}

@book{Earman95,
 author = {J. Earman}, year = 1995,
 title = {{Bangs, Crunches, Whimpers and Shrieks - Singularities and Acausalities in Relativistic Spacetimes}},
 address = {Oxford}, publisher = OUP
}

@article{EN93,
 author = {J. Earman and J.D. Norton}, year = 1993,
 title = {{Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes}},
 journal = {Philosophy of Science},
 volume = 5, pages = {22--42}
}

@incollection{EN96,
 author = {J. Earman and J.D. Norton}, year = 1996,
 title = {{Infinite Pains: The Trouble with Supertasks}},
 editor = {A. Morton and S.P. Stich},
 booktitle = {{Benacerraf and his Critics}},
 address = {Cambridge, MA}, publisher = {Blackwell}, pages = {231--261}
}

@incollection{EGW04,
 author = {E. Eberbach and D. Goldin and P. Wegner}, year = 2004,
 title = {{Turing's Ideas and Models of Computation}},
 editor = {C. Teuscher}, year = 2004,
 booktitle = {{Alan Turing: Life and Legacy of a Great Thinker}},
 address = {Berlin}, publisher = Springer,
 pages = {159--194}
}

@article{EN02,
 author = {G. Etesi and I. Nemeti},
 title = {{Non-Turing Computability via Ma;ament-Hogarth Space-Times}},
 journal = {Int. J. Theoretical Physics},
 volume = 41, number = 2, pages = {341--370}
}

@inproceedings{FG91,
 author = {S. Franklin and M. Garzon}, year = 1991,
 title = {{Neural Computability}},
 editor = {O. Omidvar},
 booktitle = {{Progress in Neural Networks}}, volume = 1,
 publisher = {Ablex}
}

@article{Gams02,
 author = {M. Gams}, year = 2002,
 title = {{The Turing Machine may not be the Universal Machine - A Reply to Dunlop}},
 journal = MAM,
 volume = 12, pages = {137-–142}
}

@incollection{Gandy80,
 author = {R. Gandy}, year = 1980,
 title = {{Church's Thesis and Principles for Mechanisms}},
 editor = {J. Barwise and H.J. Kreisler and K. Kunen},
 booktitle = {{The Kleene Symposium}},
 address = {Amsterdam}, publisher = {North-Holland},
 pages = {123--148}
}

@article{GS99,
 author = {R. Gavald{\`a} and H.T. Siegelmann}, year = 1999,
 title = {{Discontinuities in Recurrent Neural Networks}},
 journal = {Neural Computation},
 volume = 11, number = 3, pages = {715--745}
}

@inproceedings{GF89,
 author = {M. Garzon and S. Franklin}, year = 1989,
 title = {{Neural Computability II}},
 booktitle = {{Proc. International Joint Conference on Neural Networks}},
 volume = I, pages = {631--637}
}

@article{GH86,
 author = {R, Geroch and J.B. Hartle}, year = 1986,
 title = {{Computability and Physical Theories}},
 journal = {Foundations of Physics},
 volume = 16, pages = {533--550}
}

@article{Gold65,
 author = {E.M. Gold}, year = 1965,
 title = {{Limiting Recursion}},
 journal = {J. Symbolic Logic},
 volume = 30, pages = {28--48}
}

@article{HL00,
 author = {J.D. Hamkins and A. Lewis}, year = 2000,
 title = {{Infinite Time Turing Machines}},
 journal = {J. Symbolic Logic},
 volume = 65, number = 2, pages = {567--604}
}

@article{Hamkins02,
 author = {J.D. Hamkins}, year = 2002,
 title = {{Infinite Time Turing Machines}},
 journal = MAM,
 volume = 12, pages = {521--539}
}

@inproceedings{HS87,
 author = {R. Hartley and H. Szu}, year = 1987,
 title = {{A Comparison of the Computational Power of Neural Network Models}},
 booktitle =  {Proc. {IEEE} Conf. on Neural Networks}},
 pages = {17--22}
}

@inproceedings{HB97,
 author = {I. Harvey and T. Bossomaier}, year = 1997,
 title = {{Time Out of Joint: Attractors in Asynchronous Random Boolean Networks}},
 editor = {P. Husbands and I. Harvey},
 booktitle = {{Fourth European Conference on Artificial Life}},
 address = {Cambridge, MA}, publisher = {MIT Press}
}

@incollection{Hasslacher88,
 author = {B. Hasslacher}, year = 1988,
 title = {{Beyond the Turing Machine}},
 editor = {R.Herken},
 booktitle = {{The Universal Turing Machine: A Half-Century Survey}},
 address = {Oxford}, publisher = OUP,
 note = {Reprinted 1994; Berlin: Springer-Verlag},
 pages = {387--402}
}

@article{Hogarth92,
 author = {M.L. Hogarth}, year = 1992,
 title = {{Does General Relativity Allow an Observer to View an Eternity in a Finite Time?}},
 journal = {Foundations of Physics Letters},
 volume = 5, pages = {73--81}
}

@incollection{Hogarth94,
 author = {M.L. Hogarth}, year = 1994,
 title = {{Non-Turing Computers and Non-Turing Computability}},
 editor = {D. Hull and M. Forbes and R.M. Burian},
 publisher = {Philosophy of Science Association},
 address = {East Lansing},
 booktitle = {{PSA 1994}}, volume = 1, pages = {126--138},
 note = {\Online{hypercomputation.net/}}
}

@phdthesis{Hogarth96,
 author = {M.L. Hogarth}, year = 1996,
 title = {{Predictability, Computability and Spacetime}},
 school = {Cambridge University},
 note = {\Online{hypercomputation.net/}}
}

@misc{Hogarth02,
 author = {M.L. Hogarth}, year = 2002,
 title = {{Deciding Arithmetic in Malament-Hogarth Spacetimes}},
 note = {\Online{hypercomputation.net/}}
}

@article{Hogarth04,
 author = {M.L. Hogarth}, year = 2004,
 title = {{Deciding Arithmetic using SAD Computers}},
 journal = BJPS, volume = 55, pages = {681--691}
}

@article{Israel02,
 author = {D. Israel}, year = 2002,
 title = {{Reflections on G{\"o}del's and Gandy's Reflections on Turing's Thesis}},
 journal = MAM,
 volume = 12, pages = {181--201}
}

@book{Kampis91,
 author = {G. Kampis}, year = 1991,
 title = {{Self-Modifying Systems in Biology and Cognitive Science: A New Framework for Dyamics, Information and Complexity}},
 address = {Oxford}, publisher = {Pergamon}
}

@article{Kampis95,
 author = {G. Kampis}, year = 1995,
 title = {{Computability, Self-Reference and Self-Amendment}},
 journal = {Communications and Cognition - Artificial Intelligence},
 volume = 12, pages = {91--110}
}

@incollection{KL82,
 author = {R.M. Karp and R.J. Lipton}, year = 1982,
 title = {{Turing Machines that Take Advice}},
 editor = {E. Engeler et al},
 booktitle = {{Logic and Algorithmic}}
 address = {Gen{\`e}ve},
 publisher = {L'Enseignement Math{\'e}matique}
}

@article{Kelly04,
 author={K.T. Kelly},
 title = {{Uncomputability: the problem of induction internalized}},
 journal = TCS,
 volume = 317, pages = {227--249},
 year = 2004
}

@misc{Kieu02a,
 author = {T.D. Kieu}, year = {7 March 2002},
 title = {{Computing the noncomputable}},
 note = {\TwoOnline{hypercomputation.net/}{xxx.lanl.gov/ (arXiv:quant-ph/0203034)}}
}

@article{Kieu02b,
 author = {T.D. Kieu}, year = 2002,
 title = {{Quantum Hypercomputation}},
 journal = MAM,
 volume = 12, pages = {541-–561}
}

@article{Kieu04,
 author={T.D. Kieu},
 title = {{Hypercomputation with quantum adiabatic processes}},
 journal = TCS,
 volume = 317, pages = {93--104},
 year = 2004
}

@article{KS96,
 author = {J. Kilian and H.T. Siegelmann}, year = 1996,
 title = {{The Dynamic Universality of Sigmoidal Neural Networks}},
 journal = {Information and Computation}},
 volume = 128, number = 1, pages = {48--56}
}

@book{Kleene67,
 author = {S.C. Kleene}, year = 1967,
 title = {{Mathematical Logic}},
 address = {New York}, publisher = Wiley
}

@article{Komar64,
 author = {A. Komar}, year = 1964,
 title = {{Undecidability of macroscopically distinguishable states in quantum field theory}},
 journal = {Physical Review (second series)},
 volume = {133B}, pages = {542--544}
}

@incollection{Kreisel65,
 author = {G. Kreisel}, year = 1965,
 title = {{Mathematical Logic}},
 editor = {T.L. Saaty},
 booktitle = {{Lectures on Modern Mathematics}}, volume = 3,
 address = {New York}, publisher = Wiley
}

@incollection{Kreisel67,
 author = {G. Kreisel}, year = 1967,
 title = {{Mathematical Logic: What has it done for the Philosophy of Mathematics?}},
 editor = {R. Schoenmann},
 booktitle = {{Bertrand Russell: Philosopher of the Century}},
 address = {London}, publisher = {George Allen and Unwin}
}

@incollection{Kreisel70,
 author = {G. Kreisel}, year = 1970,
 title = {{Hilbert's Programme and the Search for Automatic Proof Procedures}},
 editor = {M. Laudet et al},
 booktitle = {{Symposium on Automatic Demonstration}},
 series = {Lecture Notes in Mathematics},
 volume = 125,
 address = {Berlin}, publisher = Springer
}

@incollection{Kreisel71,
 author = {G. Kreisel}, year = 1971,
 title = {{Some Reasons for Generalising Recursion Theory}},
 editor = {R.O. Gandy and C.M.E. Yates},
 booktitle = {{Logic Colloquium '69}},
 address = {Amsterdam}, publisher = {North-Holland}
}

@article{Kreisel72,
 author = {G. Kreisel}, year = 1972,
 title = {{Which Number-Theoretic Problems can be Solved in Recursive Progressions on $\pi_1^1$-Paths through {$0$}?}},
 journal = {J. Symbolic Logic},
 volume = 37, pages = {311--334}
}

@article{Kreisel74,
 author = {G. Kreisel}, year = 1974,
 title = {{A Notion of Mechanistic Theory}},
 journal = {Synthese},
 volume = 29, pages = {11--26}
}

@article{Kreisel87,
 author = {G. Kreisel}, year = 1987,
 title = {{Church's Thesis and the Ideal of Formal Rigour}},
 journal = {Notre Dame J. Formal Logic},
 volume = 28, pages = {499--519}
}

@article{Krylov86a,
 author = {S.M. Krylov}, year = 1986,
 title = {{Formal Technology and Universal Systems, Part 1}},
 journal = {Cybernetics},
 volume = 4, pages = {85--89}
}

@article{Krylov86b,
 author = {S.M. Krylov}, year = 1986,
 title = {{Formal Technology and Universal Systems, Part 2}},
 journal = {Cybernetics},
 volume = 5, pages = {28--31}
}

@article{Krylov96,
 author = {S.M. Krylov}, year = 1996,
 title = {{Formal Technology and Cognitive Processes}},
 journal = {Int. J. General Systems},
 volume = 24, pages = {233--243}
}

@techreport{Krylov97,
 author = {S.M. Krylov}, year = 1997,
 title = {{Formal Technology in Philosophy, Engineering, Bio-evolution and Sociology}},
 institution = {Samara State Technical University}
}

@article{Kugel86,
 author = {P. Kugel}, year = 1986,
 title = {{Thinking may be More Than Computing}},
 journal = {Cognition},
 volume = 32, pages = {137--198}
}

@article{Kugel90,
 author = {P. Kugel}, year = 1990,
 title = {{Myhill's thesis: there's more than computing in musical thinking}},
 journal = {Computer Music Journal},
 volume = 14, number = 1, pages = {12--25}
}

@misc{Kugel01,
 author = {P. Kugel}, year = 2001,
 title = {{Can computers be genuinely intelligent?}},
 note = {\Online{hypercomputation.net/}}
}

@article{Kugel02,
 author = {P. Kugel}, year = 2002,
 title = {{Computing Machines can’t be Intelligent (\dots and Turing said so)}},
 journal = MAM, 
 volume = 12, pages = {563-–579}
}

@article{Kugel04,
 author={P. Kugel},
 title = {{Towards a theory of intelligence}},
 journal = TCS,
 volume = 317, pages = {13--30},
 year = 2004
}

@article{LR87,
 author = {L. Lipshitz and L.A. Rubel}, year = 1987,
 title = {{A Differentially Algebraic Replacement Theorem, and Analog Computability}},
 journal = {Proc. AMS},
 volume = 99, pages = {367--372}
}

@article{Lipton95,
 author = {R.J. Lipton}, year = 1995,
 title = {{{DNA} Solution of Hard Computational Problems}},
 journal = {Science}
 volume = 268, pages = {542--545}
}

@misc{Lokhorst00,
 author = {G.J. Lokhorst},
 title = {{Why I am not a Super-Turing Machine}},
 organisation = {Prsented at Hypercomputation Workshop},
 address = {University College London},
 year = {24 May 2000}
}

@techreport{MO97,
 author = {W. Maass and P. Orponen}, year = 1997,
 title = {{On the Effect of Analog Noise in Discrete-Time Analog Computability}},
 institution = {NeuroColt},
 number = {NC-TR-97-042}
}

@article{MS99,
 author = {W. Maass and E.D. Sontag}, year = 1999,
 title = {{Analog Neural Nets with Gaussian or Other Common Noise Distributions cannot Recognise Arbitrary Regular Languages}},
 journal = {Neural Computation},
 volume = 11, number = 3, pages = {771--782}
}

@inproceedings{MacLennan87,
 author = {B.J. MacLennan}, year = 1987,
 title = {{Technology-Independent Design of Neurocomputers: The Universal Field Computer}},
 editor = {M. Caudill and C. Butler},
 booktitle = {{Proceedings of the IEEE First International Conference on Neural Networks}},
 volume = 3, address = {San Diego, CA}, publisher = {IEEE Press},
 pages = {39--49}
}

@incollection{MacLennan88,
 author = {B.J. MacLennan}, year = 1988,
 title = {{Logic for the New AI}},
 editor = {J.H. Fetzer},
 booktitle = {{Aspects of Artifical Intelligence}},
 address = {Dordrecht, The Netherlands},
 publisher = {Kluwer Academic Publishers},
 pages = {163--192}
}

@techreport{MacLennan90,
 author = {B.J. MacLennan}, year = 1990,
 title = {{Field Computation: A Theoretical Framework for Massively Parallel Analog Computation, Parts I-IV}},
 number = {CS-90-100},
 institution = {Dept of Computer Science, University of Tennessee, Knoxville, USA},
 note = {\Online{www.cs.utk.edu/$\sim$mclennan/}}
}

@article{MacLennan93a,
 author = {B.J. MacLennan}, year = 1993,
 title = {{Characteristics of Connectionist Knowledge Representation}},
 journal = {Information Sciences},
 volume = 70, pages = {119--143},
 note = {\Online{www.cs.utk.edu/$\sim$mclennan/}}
}

@incollection{MacLennan93b,
 author = {B.J. MacLennan}, year = 1993,
 title = {{Field Computation in the Brain}},
 editor = {K. Pribram},
 booktitle = {{Rethinking Neural Networks: Quantum Fields and Biological Data}},
 address = {Hillsdale, NJ},
 publisher = {Lawrence Erlbaum},
 pages = {199--232},
 note = {\Online{www.cs.utk.edu/$\sim$mclennan/}}
}

@article{MacLennan93c,
 author = {B.J. MacLennan}, year = 1993,
 title = {{Grounding Analog Computers}},
 journal = {Think},
 volume = 2, pages = {48--51},
 note = {\TwoOnline{www.cs.utk.edu/$\sim$mclennan/}{cogprints.soton.ac.uk/abs/comp/199906003}}
}

@incollection{MacLennan94a,
 author = {B.J. MacLennan}, year = 1994,
 title = {{Continuous Computation and the Emergence of the Discrete}},
 editor = {K.H. Pribram},
 booktitle = {{Origins: Brain and Self-Organisation}},
 address = {Hillsdale, NJ},
 publisher = {Lawrence Erlbaum},
 pages = {121--151},
 note = {\TwoOnline{www.cs.utk.edu/$\sim$mclennan/}{cogprints.soton.ac.uk/abs/comp/199906001}}
}

@incollection{MacLennan94b,
 author = {B.J. MacLennan}, year = 1994,
 title = {{Continuous Symbol Systems: The Logic of Connectionism}},
 editor = {D.S. Levine and M. Aparicio IV},
 booktitle = {{Neural Networks for Knowledge Representation and Inference}},
 address = {Hillsdale, NJ},
 publisher = {Lawrence Erlbaum},
 pages = {121-151},
 note = {\Online{www.cs.utk.edu/$\sim$mclennan/}}
}

@inproceedings{MacLennan95,
 author = {B.J. MacLennan}, year = 1995,
 title = {{Continuous Formal Systems: A Unifying Model in Language and Cognition}},
 booktitle = {{Proc. IEEE Workshop on Architectures for Semiotic Modeling and Situation Analysis in Large Complex Systems}},
 address = {Monterey, CA},
 pages = {161--172},
 note = {\TwoOnline{www.cs.utk.edu/$\sim$mclennan/}{cogprints.soton.ac.uk/abs/comp/199906002}}
}

@incollection{MacLennan97,
 author = {B.J. MacLennan}, year = 1997,
 title = {{Field Computation in Motor Control}},
 editor = {P.G. Morasso and V. Sanguineti},
 booktitle = {{Self-Organization, Computational Maps and Motor Control}},
 address = {Amsterdam, The Netherlands},
 publisher = {Elsevier},
 pages = {37--73},
 note = {\Online{www.cs.utk.edu/$\sim$mclennan/}}
}

@article{MacLennan99,
 author = {B.J. MacLennan}, year = 1999,
 title = {{Field Computation in Natural and Artificial Intelligence}},
 journal = {Information Sciences},
 volume = 119, pages = {73--89},
 note = {\Online{www.cs.utk.edu/$\sim$mclennan/}}
}

@techreport{MacLennan01,
 author = {B.J. MacLennan}, year = 2001,
 title = {{Can Differential Equations Compute?}},
 number = {UT-CS-01-459},
 institution = {Dept of Computer Science, University of Tennessee, Knoxville, USA},
 note = {\Online{www.cs.utk.edu/$\sim$mclennan/}}
}

@article{MacLennan03,
 author = {B.J. MacLennan}, year = 2003,
 title = {{Transcending Turing Computability}},
 journal = MAM,
 volume = 13, number = 1, pages = {3--22}
}

@article{MacLennan04,
 author={B.J. MacLennan},
 title = {{Natural computation and non-Turing models of computation}},
 journal = TCS,
 volume = 317, pages = {115--145},
 year = 2004
}

@incollection{Montague62,
 author = {R. Montague}, year = 1962,
 title = {{Towards a General Theory of Computability}},
 editor = {B.Kazemier and D.Vuysje},
 booktitle = {{Logic and Language}},
 publisher = {Reidel}
}

@article{Myhill71,
 author = {J. Myhill}, year = 1971,
 title = {{A recursive function, defined on a compact interval and having a continuous derivative that is not recursive}},
 journal = {\textit{Michigan Math. J.}},
 volume = {\textbf{18}}, pages = {97--98}
}

@article{Newman55,
 author = {M.H.A. Newman}, year = 1955,
 title = {{Alan Mathison Turing 1912 - 1954}},
 journal = {Biographical Memoirs of the Fellows of the Royal Society},
 volume = 1, pages = {253--263}, month = Nov
}

@mastersthesis{Ord02,
 author = {T. Ord}, year = 2002,
 type = {Honours Thesis},
 title = {{Hypercomputation: computing more than the Turing machine}},
 note = {\Online{hypercomputation.net/}}
}

@book{Penrose89,
 author = {R. Penrose}, year = 1989,
 title = {{The Emperor's New Mind: Concerning Computers, Minds and the Laws of Physics}},
 address = {Oxford}, publisher = OUP
}

@article{Penrose90,
 author = {R. Penrose}, year = 1990,
 title = {{Pr{\'e}cis of The Emperor's New Mind: Concerning Computers, Minds and the Laws of Physics}},
 journal = {Behavioural and Brain Sciences},
 volume = 13, pages = {643--655, 692--705}
}

@book{Penrose94,
 author = {R. Penrose}, year = 1994,
 title = {{Shadows of the Mind: A Search for the Missing Science of Consciousness}},
 address = {Oxford}, publisher = OUP
}

@article{Piccinini03,
 author =  {G. Piccinini}, year = 2003,
 title = {{Alan Turing and the Mathematical Objection}},
 journal = MAM,
 volume = 13, number = 1, pages = {23--48}
}

@article{Pitowsky90,
 author = {I. Pitowsky}, year = 1990,
 title = {{The Physical Church Thesis and Physical Computational Complexity}},
 journal = {Iyuun},
 volume = 39, pages = {81--99}
}

@article{PourEl74,
 author = {M.B. Pour-El}, year = 1974,
 title = {{Abstract Computability and its Relation to the General Purpose Analog Computer}},
 journal = {Trans. AMS},
 volume = 199, pages = {1--28}
}

@article{PR79,
 author = {M.B. Pour-El and J.I. Richards}, year = 1979,
 title = {{A Computable Ordinary Differential Equation which possesses No Computable Solution}},
 journal = {Annals of Mathematical Logic},
 volume = 17, pages = {61--90}
}

@article{PR81,
 author = {M.B. Pour-El and J.I. Richards}, year = 1981,
 title = {{The Wave Equation with Computable Initial Data such that its Unique Solution is not Computable}},
 journal = {Advances in Mathematics},
 volume = 39, pages = {215--239}
}

@book{PR89,
 author = {M.B. Pour-El and J.I. Richards}, year = 1989,
 title = {{Computability in Analysis and Physics}},
 address = {Berlin}, publisher = Springer
}

@incollection{Putnam60,
 author = {H. Putnam}, year = 1960,
 title = {{Minds and Machines}},
 editor = {S. Hook},
 booktitle = {{Dimensions of Mind}},
 address = {New York},
 publisher = {New York University Press}
}

@article{Putnam65,
 author = {H. Putnam}, year = 1965,
 title = {{Trial and Error Predicates and the Solution of a Problem of Mostowski}},
 journal = {J. Symbolic Logic},
 volume = 30, pages = {49--57}
}

@book{Putnam92,
 author = {H. Putnam}, year = 1992,
 title = {{Renewing Philosophy}},
 address = {Cambridge, MA},
 publisher = {Harvard University Press}
}

@article{Rubel85,
 author = {L.A. Rubel}, year = 1985,
 title = {{The Brain as an Analog Computer}},
 journal = {J. Theoretical Neurobiology},
 volume = 4,
 pages = {73--81}
}

@article{Rubel88,
 author = {L.A. Rubel}, year = 1988,
 title = {{Some Mathematical Limitations of the General-Purpose Analog Computer}},
 journal = {Advances in Applied Mathematics},
 volume = 9, pages = {22--34}
}

@simulation{Rubel89,
 author = {L.A. Rubel}, year = 1989,
 title = {{Digital Simulation of Analog Computation and Church's Thesis}},
 journal = {J. Symbolic Logic},
 volume = 54, pages = {1011--1017}
}

@article{Scarpellini63,
 author = {B. Scarpellini}, year = 1963,
 title = {{Zwei Unentscheitbare Probleme der Analysis}},
 journal = {Zeitschrift f{\"u}r mathematische Logik und Grundlagen der Mathematik},
 volume = 9, pages = {265--289}
}

@article{Scarpellini03a,
 author = {B. Scarpellini}, year = 2003,
 title = {{Two Undecidable Problems of Analysis}},
 journal = MAM,
 volume = 13, number = 1, pages = {49--77}
}

@article{Scarpellini03b,
 author = {B. Scarpellini}, year = 2003,
 title = {{Comments on `Two Undecidable Problems of Analysis'}},
 journal = MAM,
 volume = 13. number = 1, pages = {79--85}
}

@article{Schweizer02,
 author = {P. Schweizer}, year = 2002,
 title = {{Consciousness and Computation - A Reply to Dunlop}},
 journal = MAM,
 volume = 12, pages = {143-–144}
}

@article{Seligman02,
 author = {J. Seligman}, year = 2002,
 title = {{The Scope of Turing’s Analysis of Effective Procedures}},
 journal = MAM,
 volume = 12, pages = {203-–220}
}

@article{Shagrir97,
 author = {O. Shagrir}, year = 1997,
 title = {{Two Dogmas of Computationalism}},
 journal = MAM,
 volume = 7, pages = {321--344}
}

@article{Shagrir02,
 author = {O. Shagrir}, year = 2002,
 title = {{Effective Computation by Humans and Machines}},
 journal = MAM,
 volume = 12, pages = {221--240}
}

@article{Shagrir04,
 author={O. Shagrir},
 title = {{Super-tasks, accelerating Turing machines and uncomputability}},
 journal = TCS,
 volume = 317, pages = {105--114},
 year = 2004
}

@article{SP03,
 author = {O. Shagrir and I. Pitowsky}, year = 2003,
 title = {{Physical Hypercomputation and the Church-Turing Thesis}},
 journal = MAM,
 volume = 13, number = 1, pages = {87--101}
}

@article{Siegelmann95,
 author = {H.T. Siegelmann}, year = 1995,
 title = {{Computation Beyond the Turing Limit}},
 journal = {Science},
 volume = 268, pages = {545--548}
}

@article{Siegelmann96a,
 author = {H.T. Siegelmann}, year = 1996,
 title = {{Analog Computational Power}},
 journal = {Science},
 volume = 271, number = 19, month = Jan, pages = {373}
}

@article{Siegelmann96b,
 author = {H.T. Siegelmann}, year = 1996,
 title = {{The Simple Dynamics of Super Turing Theories}},
 journal = TCS,
 volume = 168,
 note = {2-part special issue on UMC},
 pages = {461--472}
}

@book{Siegelmann99a,
 author = {H.T. Siegelmann}, year = 1999,
 title = {{Neural Networks and Analog Computation: Beyond the Turing Limit}}
}

@article{Siegelmann99b,
 author = {H.T. Siegelmann}, year = 1999,
 title = {{Stochastic Analog Networks and Computational Complexity}},
 journal = {J. Complexity},
 volume = 15, number = 4, pages = {451=-475}
}

@article{Siegelmann03,
 author = {H.T. Siegelmann}, year = 2003,
 title = {{Neural and Super-Turing Computing}},
 journal = MAM,
 volume = 13, number = 1, pages = {103--114}
}

@article{SBF99,
 author = {H.T. Siegelmann and A. Ben-Hur and S.Fishman}, year = 1999,
 title = {{Computational Complexity for Continuous Time Dynamics}},
 journal = {Physical Review Letters},
 volume = 83, number = 7, pages = {1463--1466}
}

@article{SF98,
 author = {H.T. Siegelmann and S. Fishman}, year = 1998,
 title = {{Computation by Dynamical Systems}},
 journal = {Physica D},
 volume = 120, pages = {214--235}
}

@article{SM99,
 author = {H.T. Siegelmann and M. Margenstern}, year = 1999,
 title = {{Nine Neurons Suffice for Turing Universality}},
 journal = {Neural Networks},
 volume = 12, pages = {593--600}
}

@article{SS91,
 author = {H.T. Siegelmann and E.D. Sontag}, year = 1991,
 title = {{Turing Computability with Neural Networks}},
 journal = {Applied Mathematics Letters},
 volume = 4, number = 6, pages = {77--80}
}

@inproceedings{SS92,
 author = {H.T. Siegelmann and E.D. Sontag}, year = 1992,
 title = {{On the Computational Power of Neural Nets}},
 booktitle = {{Proc. 5th Annual ACM Workshop on Computational Learning Theory},
 pages = {440--449}
}

@article{SS94,
 author = {H.T. Siegelmann and E.D. Sontag}, year = 1994,
 title = {{Analog Computation via Neural Networks}},
 journal = TCS,
 volume = 131, pages = {331--360}
}

@article{SS95,
 author = {H.T. Siegelmann and E.D. Sontag}, year = 1995,
 title = {{Computational Power of Neural Networks}},
 journal = {J. Computer System Sciences},
 volume = 50, number = 1, pages = {132--150}
}

@article{Smale88,
 author = {S. Smale}, year = 1988,
 title = {{The Newtonian Contribution to our Understanding of the Computer}},
 journal = {Queen's Quarterly},
 volume = 95, pages = {90--95}
}

@article{Stannett90a,
 author = {M. Stannett}, year = 1990,
 title = {{X-Machines and the Halting Problem: Building a super-Turing machine}},
 journal = {Formal Aspects of Computing},
 volume = 2, pages = {331--341}
}

@article{Stannett90b,
 author = {M. Stannett}, year = 1990,
 title = {{Implications of 'X-Machines and the Halting Problem: Building a super-Turing machine' for Computational AI}},
 journal = {AISB Quarterly},
 volume = 74
}

@techreport{Stannett91,
 author = {M. Stannett}, year = 1991,
 title = {{An introduction to post-Newtonian and non-Turing computation}},
 note = {\Online{www.dcs.shef.ac.uk/research/resmems/}},
 number = {CS-91-02},
 institution = DCS
}

@techreport{Stannett01a,
 author = {M. Stannett}, year = 2001,
 title = {{Hypercomputation is physically irrefutable}},
 note = {\Online{www.dcs.shef.ac.uk/research/resmems/}},
 number = {CS-01-04},
 institution = DCS
}

@techreport{Stannett01b,
 author = {M. Stannett}, year = 2001,
 title = {{Computation over arbitrary models of time (a unified model of discrete, analog, quantum and hybrid computation)}},
 note = {\Online{www.dcs.shef.ac.uk/research/resmems/}},
 number = {CS-01-08},
 institution = DCS
}

@article{Stannett03,
 author = {M. Stannett}, year = 2003,
 title = {{Computation and Hypercomputation}},
 journal = MAM,
 volume = 13, number = 1, pages = {115--153}
}

@incollection{Stannett04,
 author = {M. Stannett}, year = 2004,
 title = {{Hypercomputational Models}},
 editor = {C. Teuscher}, year = 2004,
 booktitle = {{Alan Turing: Life and Legacy of a Great Thinker}},
 address = {Berlin}, publisher = Springer,
 pages = {135--157}
}

@article{Steinhart02,
 author = {E. Steinhart}, year = 2002,
 title = {{Logically possible machines}},
 journal = MAM,
 volume = 12, number = 2, pages = {259--280}
}

@article{Steinhart03,
 author = {E. Steinhart}, year = 2003,
 title = {{Supermachines and Superminds}},
 journal = MAM,
 volume = 13, number = 1, pages = {155--186}
}

@article{Stewart91a,
 author = {I. Stewart}, year = 1991,
 title = {{Deciding the Undecidable}},
 journal = {Nature},
 volume = 352, pages = {664--665}
}

@article{Stewart91b,
 author = {I. Stewart}, year = 1991,
 title = {{The Dynamics of Impossible Devices}},
 journal = {Nonlinear Science Today},
 volume = 1, pages = {8--9}
}

@incollection{Timpson04,
 author = {C.G. Timpson}, year = 2004,
 title = {{Quantum Computers: the Church-Turing Hypothesis Versus the Turing Principle}},
 editor = {C. Teuscher}, year = 2004,
 booktitle = {{Alan Turing: Life and Legacy of a Great Thinker}},
 address = {Berlin}, publisher = Springer,
 pages = {213--240}
}

@book{Teuscher04,
 editor = {C. Teuscher}, year = 2004,
 title = {{Alan Turing: Life and Legacy of a Great Thinker}},
 address = {Berlin}, publisher = Springer
}

@article{Turing36,
 author = {A.M. Turing}, year = {1936-1937},
 title = {{On Computable Numbers, with an Application to the Entscheidungsproblem}},
 journal = {Proc. LMS, Series 2},
 volume = 42, pages = {230--265}
}

@phdthesis{Turing38,
 author = {A.M. Turing}, year = 1938,
 title = {{Systems of Logic based on Ordinals}},
 school = {Princeton University},
 note = {Published as \cite{Turing39}}
}

@article{Turing39,
 author = {A.M. Turing}, year = 1939,
 title = {{Systems of Logic based on Ordinals}},
 journal = {Proc. LMS, Series 2},
 volume = 45, pages = {161--228},
 note = {Originally produced as \cite{Turing38}}
}

@incollection{Turing48,
 author = {A.M. Turing}, year = 1948,
 title = {{Intelligent Machinery}},
 editor = {B. Meltzer and D. Michie},
 booktitle = {{Machine Intelligence}}, volume = 5,
 address = {Edinburgh}
 publisher = {Edinburgh University Press},
 note = {\Online{www.AlanTuring.net}}
}

@article{Turing50,
 author = {A.M. Turing}, year = 1950,
 title = {{Computing Machinery and Intelligence}},
 journal = {Mind},
 volume = 59, number = 236, pages = {433--460}
}

@proceedings{MI-15,
 editor = {K. Furukawa and D. Michie and S. Muggleton},
 title = {{Machine Intelligence}}, volume = 15, year = 0000,
 address = {Oxford}, publisher = OUP
}

@incollection{Turing51a,
 author = {A.M. Turing}, year = 1951,
 title = {{Can Digital Computers Think?}},
 editor = {B.J. Copeland},
 booktitle = {{A Lecture and Two Radio Broadcasts on Machine Intelligence by Alan Turing}},
 note = {In \cite{MI-15}}
}

@incollection{Turing51b,
 author = {A.M. Turing}, year = {c. 1951},
 title = {{Intelligent Machinery, A Heretical Theory}},
 editor = {B.J. Copeland},
 booktitle = {{A Lecture and Two Radio Broadcasts on Machine Intelligence by Alan Turing}},
 note = {In \cite{MI-15}}
}

@article{Wegner97,
 author = {P. Wegner}, year = 1997,
 title = {{Why Interaction is More Powerful than Algorithms}},
 journal = {Comms ACM},
 volume = 40, pages = {80--91}
}

@article{Welch00a,
 author = {P.D. Welch}, year = 2000,
 title = {{The Length of Infinite Time Turing Machine Computations}},
 journal BullLMS,
 volume = 32, pages = {129--136}
}

@article{Welch00b,
 author = {P.D. Welch}, year = 2000,
 title = {{Eventually Infinite Time Turing Degrees: Infinite Time Decidable Reals}},
 journal = {J. Symbolic Logic},
 volume = 65, number = 3, pages = {1193-1203}
}

@incollection{Welch04a,
 author = {P.D. Welch}, year = 2004,
 title = {{Post's and Other Problems in Higher Type Supertasks}},
 editor = {B. L{\"o}we and W. Malzkorn and T. R{\"a}sch},
 booktitle = {{Classical and New Paradigms of Computation and their Complexity Hierarchies, Foundations of Formal Sciences III}},
 series = {Trends in Logic},
 volume = 23, address = {Dordrecht}, publisher = {Kluwer}
}

@article{Welch04b,
 author = {P.D. Welch}, year = 2004,
 title = {{On the Possibility, or Otherwise, of Hypercomputation}},
 journal = BJPS,
 volume = 55, pages = {739--746}
}

@article{Wells02,
 author = {B. Wells}, year = 2002,
 title = {{Is there a Nonrecursive Decidable Equational Theory?}},
 journal = {Minds and Machines},
 volume = 12, pages = {303-–326}
}

@article{Wells04,
 author={B. Wells},
 title = {{Hypercomputation by definition}},
 journal = TCS,
 volume = 317, pages = {191--207},
 year = 2004
}

@article{Wiedermann04,
 author={J. Wiedermann},
 title = {{Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines}},
 journal = TCS,
 volume = 317, pages = {61--69},
 year = 2004
}

@article{Wolfram85,
 author = {S. Wolfram}, year = 1985,
 title = {{Undecidability and Intractability in Theoretical Physics}},
 journal = {Physical Review Letters},
 volume = 54, pages = {735--738}
}