Sharvy’s Lucy and Benjamin Puzzle

@article{Forster2008SharvysLA,
  title={Sharvy’s Lucy and Benjamin Puzzle},
  author={Thomas E. Forster},
  journal={Studia Logica},
  year={2008},
  volume={90},
  pages={249-256}
}
  • T. Forster
  • Published 25 October 2008
  • Philosophy
  • Studia Logica
Sharvy’s puzzle concerns a situation in which common knowledge of two parties is obtained by repeated observation each of the other, no fixed point being reached in finite time. Can a fixed point be reached? 

References

SHOWING 1-10 OF 11 REFERENCES

Accelerating Turing Machines

It is argued that accelerating Turing machines are not logically impossible devices, and there are implications concerning the nature of effective procedures and the theoretical limits of computability.

Tasks and Super-Tasks

Accelerating Turing Machines. Minds and Machines

  • Accelerating Turing Machines. Minds and Machines
  • 2002

Beweisstudien zum Satz von M

  • Zorn, Math. Nachr. 4
  • 1951

Arch. Math

  • Arch. Math
  • 1950

An Epistemic Puzzle

  • Philosophia

Math. Nachr

  • Math. Nachr
  • 1951