Advertisement

Verifiable goals for communication

  • Brendan Juba

Abstract

We saw in Chapter 2 that our sensing functions are sufficient to capture all finite goals for which we can design protocols, but we only gave two examples of such sensing functions: Example 2.23, a sensing function for the goal of printing described in Example 2.8; and Example 2.24, a sensing function for the goal of computation, first described in Section 1.4.2 and then formally revisited in Example 2.17. It is not immediately clear how many more interesting goals actually have universal protocols! Fortunately, we can show that many goals can be captured by safe and viable sensing functions, and hence have universal protocols—in fact, we believe that most (if not all) reasonable goals for communication can be captured in this way. We will support this claim by developing a variety of examples of goals, and demonstrating how we can provide sensing for each of the goals. These examples are adapted from an early technical report (Juba and Sudan, 2008).

Keywords

Polynomial Time Proof System Kolmogorov Complexity User Strategy Server Strategy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [84]
    Brendan Juba and Madhu Sudan. Universal semantic communication II: A theory of goal-oriented communication. Technical Report TR08-095, ECCC, 2008. Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.School of Engineering and Applied SciencesHarvard UniversityCambridgeUSA
  2. 2.Computer Science and Artificial Intelligence Laboratory (CSAIL)Massachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations