Did I Commit the Church-Turing Fallacy?

Today I received my complimentary copy of The Philosophy of Science: An Encyclopedia, edited by Sahotra Sarkar and Jessica Pfeifer, Routledge, 2006. I wrote the entry on artificial intelligence. To my astonishment, the entry reads as follows: If Turing’s thesis [i.e., the Church-Turing thesis] is correct, stored-program computers can perform …

Serious Metaphysics?

Bloomfield, P. (2005). “Let’s Be Realistic About Serious Metaphysics.” Synthese 144: 69-90.He argues that the only sense of possibility relevant to serious metaphysics (i.e., relevant to the metaphysics of the actual world) is how things may be given how the actual world is. (This notion of possibility-given-the-way-the-actual-world-is is supposed to …

Do Determinables Exist?

Gillett, C. and B. Rives (2005). “The Non-Existence of Determinables: Or, a World of Absolute Determinates as Default Hypothesis.” Nous 39(3): 483-504.They argue that there are no determinables, only determinates, on grounds of ontological parsimony. In their opinion, positing determinables on top of determinates leads to “double counting” of causal …

How to Improve Your Paper by a Judicious Use of Faculty

During a recent conversation with Brit Brogaard, we noticed that some students may benefit from some coaching on out how to properly use faculty to their advantage when working on a paper. The rules must be adjusted for context. If you are writing a term paper, you need to work …

Classical Computation and Hypercomputation at the 2006 Eastern APA

On Wednesday, December 28, 2006, at the Eastern APA in NYC, we held our session on classical computation and hypercomputation. (For some background, see previous posts.) From my point of view, it went roughly as follows.In my presentation, I argued that in discussions of the Physical Church-Turing Thesis (Physical CT), …

Why care about the Church-Turing thesis?

The Church-Turing thesis (CT) says that every function that is computable in an intuitive sense is computable by an ordinary computer. Here are some reasons why you might be interested: 1. In one sense, the CT tells us the limits of physical computation: what can be computed and what cannot. …

The Physical Church-Turing Thesis: Modest of Bold?

This is the title of my talk at the Eastern APA, in the session on Classical Computation and Hypercomputation (see previous post). The other presenter is Oron Shagrir and the commentator is Jack Copeland. Jack is probably the most distinguished philosopher of AI and computation, and Oron is one of …

Back to Top