A procedural solution to the unexpected hanging and Sorites paradoxes
暂无分享,去创建一个
The paradox of the Unexpected Hanging, related prediction paradoxes, and the sorites paradoxes all involve reasoning about ordered collections of entities: days ordered by date in the case of the Unexpected Hanging; men ordered by the number of hairs on their heads the case of the bald man version of the sorites. The reasoning then assigns each entity a value that depends on the previously assigned value of one of the neighboring entities. The final result is paradoxical because it conflicts with the obviously correct, commonsensical value. The paradox is due to the serial procedure of assigning a value based on the newly assigned value of the neighbor. An alternative procedure is to assign each value based only on the original values of neighbors-a parallel procedure. That procedure does not give paradoxical answers.
[1] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .
[2] Peter Ransom,et al. The Unexpected Hanging And Other Mathematical Diversions , 1992, The Mathematical Gazette.
[3] Roy Sorensen. Recalcitrant variations of the prediction paradox , 1982 .
[4] David Gries,et al. The Science of Programming , 1981, Text and Monographs in Computer Science.
[5] Timothy Y. Chow,et al. The Surprise Examination or Unexpected Hanging Paradox , 1999, math/9903160.