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 …
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 …
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), …
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. …
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 …
There will be a session on hypercomputation and related matters (such as the Church-Turing thesis) at the meeting of the American Philosophical Association, Eastern Division, in NYC, on Wednesday, December 28, between 5:15 and 7:15. As far as I know, it’s the first APA session entirely devoted to recent discussions …
