• Keine Ergebnisse gefunden

Philosophie der Berechenbarkeit – Themenliste Seminar WS06/07 Prof. Dr. P. Schroeder-Heister, Thomas Piecha

N/A
N/A
Protected

Academic year: 2021

Aktie "Philosophie der Berechenbarkeit – Themenliste Seminar WS06/07 Prof. Dr. P. Schroeder-Heister, Thomas Piecha"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Philosophie der Berechenbarkeit – Themenliste

Seminar WS06/07

Prof. Dr. P. Schroeder-Heister, Thomas Piecha

1. Davis, M.,Why G¨odel Didn’t Have Church’s Thesis, Information and Control54, 3-24 (1982).

2. Sieg, W., Step by recursive step: Church’s analysis of effective calculability, Bulletin of Sym- bolic Logic 3, 154-180 (1997).

3. Odifreddi, P., Church’s Thesis, Kapitel I.8 (S. 101-123) in: Odifreddi, P., Classical Recur- sion Theory, Studies in Logic and the Foundations of Mathematics 125, North-Holland, Amsterdam (1999).

4. Cotogno, P., Hypercomputation and the Physical Church–Turing Thesis, British Journal for the Philosophy of Science54, 181-223 (2003).

5. Welch, P. D., On the Possibility, or Otherwise, of Hypercomputation, British Journal for the Philosophy of Science 55, 739-746 (2004).

Ord, T. und Kieu, T. D., The Diagonal Method and Hypercomputation, British Journal for the Philosophy of Science56, 147-156 (2005).

6. Potgieter, P. H., Zeno machines and hypercomputation, Theoretical Computer Science 358, 23-33 (2006).

7. Hamkins, J. D. und Lewis, A., Infinite Time Turing Machines, Journal of Symbolic Logic 65, 567-604 (2000).

8. Deutsch, D., Quantum theory, the Church–Turing principle and the universal quantum com- puter, Proceedings of the Royal Society of London A 400, 97-117 (1985).

9. Kieu, T.,Hypercomputation with quantum adiabatic processes, Theoretical Computer Science 317, 93-104 (2004).

10. Penrose, R.,Shadows of the Mind, Vintage, London (1995).

Feferman, S., Penrose’s G¨odelian Argument, Psyche 2, http://psyche.cs.monash.edu.au/

v2/psyche-2-07-feferman.html (1995).

11. Pour-El, M. B.,The Structure of Computability in Analysis and Physical Theory: An Extensi- on of Church’s Thesis, in: Griffor, E. R. (Hrsg.),Handbook of Computability Theory. Studies in Logic and the Foundations of Mathematics 140, S. 449-471, North-Holland, Amsterdam (1999).

12. N´emeti, I. und D´avid, G.,Relativistic computers and the Turing barrier, Applied Mathema- tics and Computation 178, 118-142 (2006).

13. Siegelmann, H. T. und Sontag, E. D., Analog computation via neural networks, Theoretical Computer Science 131, 331-360 (1994).

14. Davis, M., The Myth of Hypercomputation, in: Teuscher, C. (Hrsg.), Alan Turing: Life and Legacy of a Great Thinker, S. 195-211, Springer, Berlin (2003, 2. Aufl. 2005).

Referenzen

ÄHNLICHE DOKUMENTE

All functions that can be computed in the intuitive sense can be computed by a Turing machine. German: Church-Turing-These cannot be proven

All functions that can be computed in the intuitive sense can be computed by a Turing machine.

LOOP, WHILE and GOTO programs are structured like programs in (simple) “traditional” programming languages use finitely many variables from the set {x 0 , x 1 , x 2 ,.. } that can

show that there is a number k for every LOOP program such that the computed function value is smaller than a(k , n), if n is the largest input value. proof by structural induction;

Definition (Semantics of GOTO Programs) Input, output and variables work exactly as in LOOP and WHILE programs.. Addition and modified subtraction work exactly as in LOOP and

The course aims to present the basic results of computability theory, including mathematical models of computability, primitive recursive and partial recursive functions,

The course aims to present the basic results of computability theory, including mathematical models of computability, primitive recursive and partial recursive functions,

The course aims to present the basic results of computability theory, including mathematical models of computability, primitive recursive and partial recursive functions,