Author:
Copeland B. Jack,Shagrir Oron
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Philosophy
Reference42 articles.
1. Abramson, F.G. (1971). Effective computation over the real numbers. Twelfth annual symposium on switching and automata theory. Northridge, Calif.: Institute of Electrical and Electronics Engineers.
2. Church, A. (1940). On the concept of a random sequence. American Mathematical Society Bulletin, 46, 130–135.
3. Copeland, B. J. (1997). The broad conception of computation. American Behavioral Scientist, 40, 690–716.
4. (1998a). Super Turing-machines. Complexity, 4, 30–32.
5. (1998b). Even Turing machines can compute uncomputable functions. In C. Calude, J. Casti & M. Dinneen (Eds.), Unconventional models of computation. London: Springer-Verlag.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. ¿Existen las máquinas acelerantes de Turing?;TECHNO REVIEW. International Technology, Science and Society Review /Revista Internacional de Tecnología, Ciencia y Sociedad;2023-05-29
2. What is the Church-Turing Thesis?;Axiomatic Thinking II;2022
3. Is Church’s Thesis Still Relevant?;Studies in Logic, Grammar and Rhetoric;2020-09-01
4. Computational Neuroscience Models and Tools: A Review;Bio-inspired Neurocomputing;2020-07-22
5. The dependence of computability on numerical notations;Synthese;2020-06-17