Cargando…
Universal Semantic Communication
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 addre...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2011.
|
| Edición: | 1st ed. 2011. |
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-23297-8 | ||
| 003 | DE-He213 | ||
| 005 | 20220114110309.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 111026s2011 gw | s |||| 0|eng d | ||
| 020 | |a 9783642232978 |9 978-3-642-23297-8 | ||
| 024 | 7 | |a 10.1007/978-3-642-23297-8 |2 doi | |
| 050 | 4 | |a QA75.5-76.95 | |
| 072 | 7 | |a UYA |2 bicssc | |
| 072 | 7 | |a COM014000 |2 bisacsh | |
| 072 | 7 | |a UYA |2 thema | |
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 100 | 1 | |a Juba, Brendan. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Universal Semantic Communication |h [electronic resource] / |c by Brendan Juba. |
| 250 | |a 1st ed. 2011. | ||
| 264 | 1 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg : |b Imprint: Springer, |c 2011. | |
| 300 | |a XX, 400 p. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 505 | 0 | |a 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. | |
| 520 | |a 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. | ||
| 650 | 0 | |a Computer science. | |
| 650 | 0 | |a Computer engineering. | |
| 650 | 0 | |a Computer networks . | |
| 650 | 0 | |a User interfaces (Computer systems). | |
| 650 | 0 | |a Human-computer interaction. | |
| 650 | 0 | |a Artificial intelligence. | |
| 650 | 1 | 4 | |a Theory of Computation. |
| 650 | 2 | 4 | |a Computer Engineering and Networks. |
| 650 | 2 | 4 | |a User Interfaces and Human Computer Interaction. |
| 650 | 2 | 4 | |a Artificial Intelligence. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783642440793 |
| 776 | 0 | 8 | |i Printed edition: |z 9783642232985 |
| 776 | 0 | 8 | |i Printed edition: |z 9783642232961 |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-642-23297-8 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||