Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Ineffectual Foundations: Reply to Gwiazda

Jeanne Peijnenburg
Mind
Vol. 119, No. 476 (October 2010), pp. 1125-1133
Published by: Oxford University Press on behalf of the Mind Association
Stable URL: http://www.jstor.org/stable/23012206
Page Count: 9
  • Download ($42.00)
  • Cite this Item
Ineffectual Foundations: Reply to Gwiazda
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
[1125]
    [1125]
  • Thumbnail: Page 
1126
    1126
  • Thumbnail: Page 
1127
    1127
  • Thumbnail: Page 
1128
    1128
  • Thumbnail: Page 
1129
    1129
  • Thumbnail: Page 
1130
    1130
  • Thumbnail: Page 
1131
    1131
  • Thumbnail: Page 
1132
    1132
  • Thumbnail: Page 
1133
    1133