Computation as conversation

TL;DR: The work at the Excimer Laser Laboratory was mainly focused on the development and applications of a laser-driven plasma source emitting in the extreme ultraviolet (EUV) spectrum, on laser irradiation of textiles, on the design and test of optical systems, and on the know-how transfer of the ENEA-patented laser beam homogeniser as discussed by the authors.

TL;DR: An inquisitive dynamic epistemic logic (IDEL) is developed, which enriches the standard framework of dynamic epistemia logic (DEL), incorporating insights from recent work on Inquisitive semantics.

TL;DR: This work constructs a minimal dynamic propositional logic to describe the threshold dynamics and shows that the logic is sound and complete, and extends this framework with an epistemic dimension and investigates how information about more distant neighbors’ behavior allows agents to anticipate changes in behavior of their closer neighbors.

TL;DR: This paper is a brief case study of Backward Induction for extensive games, replacing earlier static logical definitions by stepwise dynamic ones, and shows how an abstract logical perspective can bring out basic invariant structure in games.

TL;DR: If the meaning of the words “machine” and “think” are to be found by examining how they are commonly used it is difficult to escape the conclusion that the meaning and the answer to the question, “Can machines think?” is to be sought in a statistical survey such as a Gallup poll.

TL;DR: Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed systems, artificial intelligence, and game theory.

TL;DR: Fast and frugal heuristics as discussed by the authors are simple rules for making decisions with realistic mental resources and can enable both living organisms and artificial systems to make smart choices, classifications, and predictions by employing bounded rationality.

TL;DR: The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm.