Ineffectual Foundations: Reply to Gwiazda

Jeanne Peijnenburg*

*Corresponding author for this work

Research output: Contribution to journalEditorialAcademicpeer-review

6 Citations (Scopus)


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 languageEnglish
Pages (from-to)1125-1133
Number of pages9
Issue number476
Publication statusPublished - Oct-2010


Dive into the research topics of 'Ineffectual Foundations: Reply to Gwiazda'. Together they form a unique fingerprint.

Cite this