Universal Semantic Communication
Home > Reference > Research and information: general > Information theory > Universal Semantic Communication
Universal Semantic Communication

Universal Semantic Communication


     0     
5
4
3
2
1



International Edition


X
About the Book

Is meaningful communication possible between two intelligent parties who share no common language or background? In this work, a theoretical framework is proposed in which it is possible to address when and to what extent such semantic communication is possible: such problems can be rigorously addressed by explicitly focusing on the goals of the communication. Under this framework, it is possible to show that for many goals, communication without any common language or background is possible using universal protocols. This work should be accessible to anyone with an undergraduate-level knowledge of the theory of computation. The theoretical framework presented here is of interest to anyone wishing to design systems with flexible interfaces, either among computers or between computers and their users.

Table of Contents:
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.

About the Author :
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.

Review :
"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 influence technology questions. For example, it describes how Internet communication protocols may be allowed to 'evolve organically' while maintaining functionality, a strong departure from current practice -- communicating players simply learn the new protocol as if they were learning a new language. This will surely be the future of computer-to-computer communication, and the book provides a glimpse of the first steps in this exciting path." Madhu Sudan (Microsoft Research New England Lab)


Best Sellers


Product Details
  • ISBN-13: 9783642440793
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 400
  • Returnable: Y
  • ISBN-10: 3642440797
  • Publisher Date: 30 Nov 2013
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Universal Semantic Communication
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Universal Semantic Communication
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Universal Semantic Communication

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!