| 000 | 03132nam a22004935i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-23297-8 | ||
| 003 | DE-He213 | ||
| 005 | 20140220083811.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 111026s2011 gw | s |||| 0|eng d | ||
| 020 |
_a9783642232978 _9978-3-642-23297-8 |
||
| 024 | 7 |
_a10.1007/978-3-642-23297-8 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUY _2bicssc |
|
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aCOM031000 _2bisacsh |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 100 | 1 |
_aJuba, Brendan. _eauthor. |
|
| 245 | 1 | 0 |
_aUniversal Semantic Communication _h[electronic resource] / _cby Brendan Juba. |
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011. |
|
| 300 |
_aXX, 400 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 505 | 0 | _aChap. 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. | |
| 520 | _aIs 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. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer network architectures. | |
| 650 | 0 | _aInformation theory. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aComputer Systems Organization and Communication Networks. |
| 650 | 2 | 4 | _aUser Interfaces and Human Computer Interaction. |
| 650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642232961 |
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-23297-8 |
| 912 | _aZDB-2-SCS | ||
| 999 |
_c108336 _d108336 |
||