Abstract
In an earlier paper I argued that there are cases in which an infinite probabilistic chain can be completed (Peijnenburg 2007). According to Jeremy Gwiazda, however, I have merely shown that the chain in question can be computed, not that it can be completed (Gwiazda 2010). Gwiazda thereby discriminates between two terms that I used as synonyms. In the present paper I discuss to what extent computability and completability can be meaningfully distinguished.
| Original language | English |
|---|---|
| Pages (from-to) | 1125-1133 |
| Number of pages | 9 |
| Journal | Mind |
| Volume | 119 |
| Issue number | 476 |
| DOIs | |
| Publication status | Published - Oct-2010 |