Muutke küpsiste eelistusi

One Hundred Prisoners and a Light Bulb 1st ed. 2015 [Pehme köide]

  • Formaat: Paperback / softback, 188 pages, kõrgus x laius: 235x155 mm, kaal: 454 g, 24 Illustrations, black and white; IX, 188 p. 24 illus., 1 Paperback / softback
  • Ilmumisaeg: 21-Jul-2015
  • Kirjastus: Copernicus
  • ISBN-10: 331916693X
  • ISBN-13: 9783319166933
Teised raamatud teemal:
  • Pehme köide
  • Hind: 20,90 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 24,59 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 188 pages, kõrgus x laius: 235x155 mm, kaal: 454 g, 24 Illustrations, black and white; IX, 188 p. 24 illus., 1 Paperback / softback
  • Ilmumisaeg: 21-Jul-2015
  • Kirjastus: Copernicus
  • ISBN-10: 331916693X
  • ISBN-13: 9783319166933
Teised raamatud teemal:

A group of 100 prisoners, all together in the prison dining area, are told that they will be all put in isolation cells and then will be interrogated one by one in a room containing a light with an on/off switch. The prisoners may communicate with one another by toggling the light switch (and that is the only way in which they can communicate). The light is initially switched off. There is no fixed order of interrogation, or interval between interrogations, and the same prisoner may be interrogated again at any stage. When interrogated, a prisoner can either do nothing, or toggle the light switch, or announce that all prisoners have been interrogated. If that announcement is true, the prisoners will (all) be set free, but if it is false, they will all be executed. While still in the dining room, and before the prisoners go to their isolation cells (forever), can the prisoners agree on a protocol that will set them free?

At first glance, this riddle may seem impossible to solve: how can all of the necessary information be transmitted by the prisoners using only a single light bulb? There is indeed a solution, however, and it can be found by reasoning about knowledge.

This book provides a guided tour through eleven classic logic puzzles that are engaging and challenging and often surprising in their solutions. These riddles revolve around the characters’ declarations of knowledge, ignorance, and the appearance that they are contradicting themselves in some way. Each chapter focuses on one puzzle, which the authors break down in order to guide the reader toward the solution.

For general readers and students with little technical knowledge of mathematics,One Hundred Prisoners and a Light Bulb will be an accessible and fun introduction to epistemic logic. Additionally, more advanced students and their teachers will find it to be a valuable reference text for introductory course work and further study.

Arvustused

This book, translated from the Dutch original, presents eleven problems of this kind, and develops the theory of dynamic epistemic logic to show how they can be solved. The puzzles, and book, are fun. this is an illuminating and entertaining account of these puzzles (and tells us something of their history). If you enjoyed Cheryls birthday puzzle, you will like this book. (Tony Mann, London Mathematical Society Newsletter (LMS), newsletter.lms.ac.uk, Issue 463, November, 2016)

This book can be perfectly well used as a textbook for graduate students who have an interest in (dynamic) epistemic logic. At the same time, it is accessible to anyone fascinated by this type of puzzle. For them it will be a nice way to enter the curious world of formal logic and see an amusing and entertaining puzzle transformed into a logical and significant problem about knowledge and its peculiarities. (Jean Paul Van Bendegem, Mathematical Reviews, April, 2016)

1 Consecutive Numbers
1(12)
1.1 Which Numbers Are Possible?
1(3)
1.2 What Anne and Bill Know
4(2)
1.3 Informative Announcements
6(2)
1.4 Versions
8(1)
1.5 History
9(4)
2 Hangman
13(8)
2.1 How to Guard a Secret?
13(3)
2.2 A Bridge Too Far
16(2)
2.3 Versions
18(1)
2.4 History
19(2)
3 Muddy Children
21(12)
3.1 Muddy or Not Muddy, That is the Question
21(3)
3.2 Simultaneous Actions
24(5)
3.3 Versions
29(2)
3.4 History
31(2)
4 Monty Hall
33(6)
4.1 What Is the Best Question to Ask?
33(3)
4.2 Why Is It to Your Advantage to Switch Doors?
36(1)
4.3 Versions
37(1)
4.4 History
38(1)
5 Russian Cards
39(16)
5.1 You Had Better Know What You Say
39(7)
5.2 Knowing What Another Player Knows
46(2)
5.3 Solution of the Problem
48(3)
5.4 Versions
51(1)
5.5 History
52(3)
6 Who Has the Sum?
55(10)
6.1 A Binary Tree of Uncertainty
55(3)
6.2 Informative Announcements
58(2)
6.3 The Solution
60(2)
6.4 Versions
62(1)
6.5 History
63(2)
7 Sum and Product
65(14)
7.1 Introduction
65(2)
7.2 I Know That You Do Not Know It
67(1)
7.3 I Knew You Did Not Know
68(2)
7.4 Solution of Sum and Product
70(5)
7.5 Versions
75(1)
7.6 History
76(3)
8 Two Envelopes
79(4)
8.1 High Expectations
79(2)
8.2 A Subtle Error
81(1)
8.3 Versions
82(1)
8.4 History
82(1)
9 One Hundred Prisoners and a Light Bulb
83(12)
9.1 How to Count to a Hundred with Only 1 Bit?
83(2)
9.2 One Prisoner
85(1)
9.3 Two Prisoners
85(1)
9.4 A Protocol for Three Prisoners?
85(2)
9.5 No Tricks
87(1)
9.6 Solution for One Hundred Prisoners
88(1)
9.7 Versions
89(5)
9.8 History
94(1)
10 Gossip
95(14)
10.1 Gossip Protocols
95(4)
10.2 How to Know Whom to Call
99(2)
10.3 Knowledge and Gossip
101(5)
10.4 Versions
106(1)
10.5 History
107(2)
11 Cluedo
109(14)
11.1 Introduction
109(3)
11.2 I Do not Have These Cards
112(1)
11.3 Showing a Card
113(1)
11.4 I Cannot Win
114(2)
11.5 How to Win Cluedo---Once
116(4)
11.6 Versions
120(1)
11.7 History
121(2)
12 Overview of Dynamic Epistemic Logic
123(34)
12.1 Introduction
123(1)
12.2 Epistemic Logic
123(5)
12.3 Multiagent Epistemic Logic
128(2)
12.4 Common Knowledge
130(2)
12.5 Public Announcements
132(8)
12.6 Unsuccessful Updates
140(4)
12.7 Epistemic Actions
144(5)
12.8 Belief Revision
149(3)
12.9 Beyond Dynamic Epistemic Logic
152(1)
12.10 Historical Notes
152(5)
13 Answers
157(26)
13.1 Answers to Puzzles from
Chapter 1
157(3)
13.2 Answers to Puzzles from
Chapter 2
160(1)
13.3 Answers to Puzzles from
Chapter 3
160(5)
13.4 Answers to Puzzles from
Chapter 4
165(1)
13.5 Answers to Puzzles from
Chapter 5
166(4)
13.6 Answers to Puzzles from
Chapter 6
170(2)
13.7 Answers to Puzzles from
Chapter 7
172(2)
13.8 Answers to Puzzles from
Chapter 8
174(1)
13.9 Answers to Puzzles from
Chapter 9
174(3)
13.10 Answers to Puzzles from
Chapter 10
177(3)
13.11 Answers to Puzzles from
Chapter 11
180(3)
References 183
Hans van Ditmarsch, PhD, is a senior researcher at LORIA, CNRS - Universite de Lorraine.

Barteld Kooi, PhD, is Professor by special appointment of logic and argumentation theory at the University of Groningen.