Universal Semantic Communication

Chap. 1, Introduction.- Chap. 2, Theory of Finite Goal-Oriented Communication.- Chap. 3, Verifiable Goals for Communication.-Chap. 4, Conditions for Efficiency in Finite Executions.- Chap. 5, Computational Complexity of Goals.- Chap. 6, Theory of Goal-Oriented Communication in Infinite Executions.- Chap. 7, The Power of Relaxed Models.- Chap. 8, The Error Complexity of Strategies in Infinite Executions.- Chap. 9, Towards Applications: Communication with a Changing Network.- Protocol.- Chap. 10, Conclusions and Directions for Future Work.- App. A, Background in Probability.- App. B, Background in Interactive Proof Systems.- App. C, Additional Background.- Bibliography.

Dr. Brendan Juba completed his PhD on the related work under the guidance of Prof. Madhu Sudan at the Massachusetts Institute of Technology, and together with Prof. Oded Goldreich they have since presented papers and lectured on the topic of the book at the key international conferences on theoretical computer science and distributed computing. Dr. Juba is currently a postdoctoral researcher with a joint position at Harvard University and MIT.

"The problem considered by this book is how two agents can successfully communicate in the absence of a prior agreement on the protocol to be used. Specific examples of potential applications include interfacing with device drivers and adapting to changing network protocols ... The ideas in the book are important and deserve to be well known." (J.P.E. Hodgson, ACM Computing Reviews, July 2012)

"This work initiates and formulates a new research direction and provides initial results about this direction. Specifically, it puts forward a general theory of goal-oriented communication, where the focus is not on the raw data being communicated but rather on the goal being achieved by the communication. The work is of fundamental nature, its essence being a novel mathematical theory that attempts to capture a key aspect in communication: its meaning." Oded Goldreich (Weizmann Institute)

"The question 'How do humans associate meaning to words?' has confounded many scholars from various disciplines, including linguistics, philosophy, psychology and media studies. This book introduces a new discipline to this list: mathematics. It attempts to frame the question 'What is the meaning of symbols?' in a totally mathematical way, using notions from the theory of computer science to formalize concepts that otherwise seem elusive. In the process it produces a formalism that not only suggests how humans may associate meaning to words, but how even a computer may associate meaning to bits. The formalism is not easy to obtain, but with a question as deep as this we should not expect easy formalisms but rather careful, correct ones.

This book produces about as careful a formalism as one can hope for at the current state of understanding. It produces a theory that formalizes many of the themes seen in prior explorations of this question, thereby solidifying the foundations. On the other hand, it also suggests ways in which such mathematical formalisms may