Universal semantic communication:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Heidelberg
Springer
2011
|
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | XIX, 397 S. graph. Darst. 25 cm |
| ISBN: | 9783642232961 3642232965 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV039835993 | ||
| 003 | DE-604 | ||
| 005 | 20120412 | ||
| 007 | t | ||
| 008 | 120124s2011 d||| |||| 00||| eng d | ||
| 015 | |a 11,N30 |2 dnb | ||
| 015 | |a 12,A03 |2 dnb | ||
| 016 | 7 | |a 1013760395 |2 DE-101 | |
| 020 | |a 9783642232961 |c Pp. : EUR 106.95 (DE, freier Pr.), ca. sfr 143.50 (freier Pr.) |9 978-3-642-23296-1 | ||
| 020 | |a 3642232965 |9 3-642-23296-5 | ||
| 024 | 3 | |a 9783642232961 | |
| 028 | 5 | 2 | |a Best.-Nr.: 80084447 |
| 035 | |a (OCoLC)768569323 | ||
| 035 | |a (DE-599)DNB1013760395 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-11 | ||
| 082 | 0 | |a 004.62 |2 22/ger | |
| 082 | 0 | |a 004.69 |2 22/ger | |
| 084 | |a ST 306 |0 (DE-625)143654: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Juba, Brendan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Universal semantic communication |c Brendan Juba |
| 264 | 1 | |a Berlin ; Heidelberg |b Springer |c 2011 | |
| 300 | |a XIX, 397 S. |b graph. Darst. |c 25 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturangaben | ||
| 650 | 0 | 7 | |a Formale Methode |0 (DE-588)4333722-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Universalsprache |0 (DE-588)4186923-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mensch-Maschine-Kommunikation |0 (DE-588)4125909-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Semantisches Netz |0 (DE-588)4242662-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungstheorie |0 (DE-588)4005581-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computerunterstützte Kommunikation |0 (DE-588)4535905-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Lerntheorie |0 (DE-588)4701014-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Semantik |0 (DE-588)4054490-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kommunikationsprotokoll |0 (DE-588)4128252-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Mensch-Maschine-Kommunikation |0 (DE-588)4125909-9 |D s |
| 689 | 0 | 1 | |a Kommunikationsprotokoll |0 (DE-588)4128252-8 |D s |
| 689 | 0 | 2 | |a Semantik |0 (DE-588)4054490-4 |D s |
| 689 | 0 | 3 | |a Universalsprache |0 (DE-588)4186923-0 |D s |
| 689 | 0 | 4 | |a Berechnungstheorie |0 (DE-588)4005581-4 |D s |
| 689 | 0 | 5 | |a Algorithmische Lerntheorie |0 (DE-588)4701014-9 |D s |
| 689 | 0 | 6 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | 7 | |a Formale Methode |0 (DE-588)4333722-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Computerunterstützte Kommunikation |0 (DE-588)4535905-2 |D s |
| 689 | 1 | 1 | |a Semantisches Netz |0 (DE-588)4242662-5 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |t Universal Semantic Communication |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3857272&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024695988&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024695988 | |
Datensatz im Suchindex
| _version_ | 1805145933603667968 |
|---|---|
| adam_text |
IMAGE 1
CONTENTS
1 INTRODUCTION 1 1.1 TECHNICAL MOTIVATION 11.2 LIMITS OF OUR SCOPE, OR:
WHAT THIS BOOK IS NOT ABOUT 4 1.3 HISTORY AND PRIOR WORK 41.3.1 PRIOR
WORK ON CETI 51.3.2 FORMAL THEORIES OF COMMUNICATION PROBLEMS 6 1.3.3
SIMILAR WORK IN OTHER AREAS 71.4 OVERVIEW OF OUR CONTRIBUTIONS 71.4.1
PHILOSOPHICAL CONTEXT 81.4.2 AN EXAMPLE: COMPUTATIONAL GOALS 91.4.3
OVERVIEW 121.4.4 CONTRIBUTIONS OF THIS BOOK IN THE CONTEXT OF ITS RELA-
TIONSHIP TO OTHER WORK 15 2 THEORY OF FINITE GOAL-ORIENTED COMMUNICATION
27 2.1 AN INFORMAL OVERVIEW OF THE THEORY 282.1.1 GOALS: A FORMAL
EXPLICATION OF MEANING 28 2.1.2 SENSING FUNCTIONS 312.1.3 CAPABILITIES
AND LIMITS OF UNIVERSAL USERS 32 2.2 MODEL OF COMMUNICATION AND GOALS
342.2.1 AGENTS: USERS, SERVERS, AND THEIR ENVIRONMENT 34 2.2.2 GOALS OF
COMMUNICATION 352.2.3 UNIVERSAL USERS 392.2.4 HELPFUL SERVERS 422.3
SENSING AND UNIVERSALITY 432.3.1 SENSING: SAFETY AND VIABILITY 442.3.2
SENSING IS NECESSARY AND SUFFICIENT FOR FINITE GOALS . . 47 2.3.3
EXTENSIONS AND VARIANTS OF SENSING: ALTERNATIVE CON- STRUCTIONS 492.3.4
SAFETY REQUIREMENTS IN THE BASIC UNIVERSAL SETTING . . 56
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1013760395 DIGITALISIERT
DURCH
IMAGE 2
I CONTENTS
VERIFIABLE GOALS FOR COMMUNICATION 59
3.1 NOTATION AND DEFINITIONS 59
3.2 CONTROL-ORIENTED GOALS 61
3.2.1 TRANSPARENT GOALS 62
3.2.2 SEARCHING 63
3.3 COMPUTATIONAL GOALS 66
3.3.1 MAIN DEFINITIONS IN THIS SETTING 67
3.3.2 CHARACTERIZATION OF FUNCTIONS WITH POLYNOMIAL TIME UNI- VERSAL
PROTOCOLS 69
3.3.3 MAIN CONSEQUENCES OF THE CHARACTERIZATION 72
3.3.4 BEYOND PSPACE-COMPLETENESS: MORE EXAMPLES OF UNI- VERSAL PROTOCOLS
FOR COMPUTATIONAL PROBLEMS 74 3.3.5 COMMUNICATION IN SPITE OF
INDETERMINACY 75
3.4 INTELLECTUAL CURIOSITY 75
3.4.1 A PRIMER ON COMPUTATIONAL DEPTH 76
3.4.2 FORMALIZING A GOAL OF INTELLECTUAL CURIOSITY 79
3.4.3 CONSTRUCTING UNIVERSAL REVIEWERS: SENSING FUNCTIONS FOR GOALS OF
INTELLECTUAL CURIOSITY 81
3.5 TESTS 81
3.5.1 A TEST OF COMPUTATIONAL ABILITY 83
3.5.2 EXAMINER STRATEGY FOR A TEST OF COMPUTATIONAL ABILITY . 86 3.5.3
PROMISES AND VERIFIABILITY 89
CONDITIONS FOR EFFICIENCY IN FINITE EXECUTIONS 91
4.1 RUNNING TIME LOWER BOUNDS VIA PASSWORDS 92
4.1.1 LOWER BOUND FOR NONTRIVIAL GOALS 92
4.1.2 EXTENSION TO PARAMETERIZED NONTRIVIALITY 94
4.2 A BAYESIAN REFINEMENT OF HELPFULNESS 96
4.2.1 BASIC NOTIONS: PRIORS AND BENCHMARKS 97
4.2.2 UNIFORM VIABILITY 100
4.2.3 AN EFFICIENT UNIVERSAL PROTOCOL FOR CLOSE PRIORS 103 4.3 EFFECTIVE
CONDITIONS FOR EFFICIENT USERS 106
4.3.1 SERVERS WITH A DESIGNATED CLASS OF PROPERLY FUNCTIONING STATES 106
4.3.2 EFFECTIVE REFINEMENTS OF SENSING 108
4.3.3 A UNIVERSAL USER FOR SERVERS THAT ARE EASY TO USE AND HARD TO
BREAK I LL
4.4 LOWER BOUNDS IN THE ABSENCE OF A COMMON PRIOR 114
4.4.1 A GENERIC LOWER BOUND WHEN NO COMMON PRIOR EXISTS . 114
COMPUTATIONAL COMPLEXITY OF GOALS 119
5.1 GENERIC COMPLEXITY CLASSES FOR INTERACTIVE COMPUTATION . . . 120
5.1.1 MODEL OF INTERACTIVE COMPUTATION 120
5.1.2 BOUNDED RESOURCES A ND SIMULATION 122
5.1.3 COMPOSITION 124
IMAGE 3
CONTENTS XVII
5.1.4 BASIC AGENTS: THE TOOLKIT 129
5.2 ON THE COMPUTATIONAL COMPLEXITY OF GOAL-ORIENTED COMMUNI- CATION 130
5.2.1 THE COMPLEXITY OF INTERPRETING VERSUS THE COMPLEXITY OF LEARNING
TO COMMUNICATE 130
5.2.2 HELPFULNESS FOR GENERIC CLASSES OF USERS 131
5.3 SENSING MODULES 132
5.3.1 SAFETY AND VIABILITY FOR GENERIC CLASSES OF AGENTS . . . 132
5.3.2 ON THE NECESSITY OF SENSING AND ITS SAFETY REQUIREMENTS 134 5.4
UNIVERSAL USERS FOR ENUMERABLE CLASSES 136
5.4.1 ENUMERABLE COMPLEXITY CLASSES 137
5.4.2 SENSING SUFFICES FOR UNIVERSAL PROTOCOLS FOR ENUMERABLE USER
CLASSES 143
5.5 THE COMPLEXITY OF UNIVERSAL USERS FOR COMPUTATIONAL PROBLEMS 145
5.5.1 COMPETITIVE INTERACTIVE PROOFS FOR GENERIC CLASSES . . . 146 5.5.2
COMPUTATIONAL GOALS FOR LOGSPACE AGENTS 152
6 THEORY OF GOAL-ORIENTED COMMUNICATION IN INFINITE EXE- CUTIONS 159
6.1 GOALS AND SENSING FOR INFINITE EXECUTIONS 160
6.1.1 GOALS IN INFINITE EXECUTIONS 161
6.1.2 THE COMPUTATIONAL COMPLEXITY OF STRATEGIES 166
6.1.3 ACHIEVING GOALS AND HELPFUL SERVERS 167
6.1.4 SENSING FOR GOALS IN INFINITE EXECUTIONS 170
6.2 ON UNIVERSAL USERS IN INFINITE EXECUTIONS 174
6.2.1 UNIVERSALITY AND SENSING IN INFINITE EXECUTIONS 176 6.2.2 SENSING
IN THE BASIC UNIVERSAL SETTING FOR INFINITE EXE- CUTIONS 181
6.2.3 UNIVERSALITY WITHOUT FEEDBACK 185
6.2.4 QUANTIFICATION OF ERRORS AND DELAYS 187
6.2.5 ON THE NON-TRIVIALITY OF STRONG SENSING FUNCTIONS . . . 197 6.3
EXTENSIONS 199
6.3.1 VARYING STATE SIZES 199
6.3.2 CONCURRENT SESSION MULTI-SESSION GOALS 204
6.3.3 PARTIAL ROBUSTNESS 206
6.4 EMBEDDING GOALS IN FINITE EXECUTIONS INTO INFINITE EXECUTIONS . 206
7 THE POWER OF RELAXED MODELS 211
7.1 UNIVERSAL PROTOCOLS FOR ANY COMPUTABLE DECISION PROBLEM . . 212
7.1.1 EFFICIENT UNIVERSAL PROTOCOLS FOR INFINITE EXECUTIONS . . 213
7.1.2 UNIVERSAL PROTOCOLS WITH BOUNDED MISTAKES FOR FINITE EXECUTIONS
216
7.2 PROTOCOLS FOR GOALS WITH EXPLORATION AND RESETTABLE SERVERS . . 223
7.2.1 MULTI-SESSION GOALS WITH EXPLORATION SESSIONS 224 7.2.2 RESETTABLE
SERVERS 226
IMAGE 4
III CONTENTS
7.2.3 A GENERIC CONSTANT-ERROR PROTOCOL FOR GOALS WITH EXPLO- RATION
SESSIONS AND RESETTABLE SERVERS 230
THE ERROR COMPLEXITY OF STRATEGIES IN INFINITE EXECUTIONS 233 8.1 ON THE
NUMBER OF ERRORS INCURRED WITH PASSWORD-PROTECTED SERVERS 234
8.2 ON-LINE LEARNING IS EQUIVALENT TO ONE-ROUND GOALS 237
8.2.1 FIXED LENGTH MULTI-SESSION GOALS 237
8.2.2 GENERIC USERS FOR GOALS IMPLICITLY SPECIFIED BY SENSING . 238
8.2.3 MODEL OF MISTAKE-BOUNDED ON-LINE LEARNING 240
8.2.4 EQUIVALENCE OF ON-LINE LEARNING AND GENERIC UNIVERSAL USERS FOR
ONE-ROUND GOALS 242
8.3 UNIVERSAL USER STRATEGIES FROM ON-LINE LEARNING ALGORITHMS . . 245
8.3.1 PARITY STRATEGIES 245
8.3.2 LINEAR THRESHOLD STRATEGIES 246
8.3.3 DEMONSTRATING OPTIMALITY VIA LITTLESTONE'S METHOD . . 251 8.3.4
GENERIC USERS FOR OTHER CLASSES OF STRATEGIES: A SURVEY . 253 8.4
OVERCOMING THE LIMITATIONS OF BASIC SENSING WITH RICHER FEED- BACK 256
8.4.1 LIMITATIONS OF BASIC SENSING 256
8.4.2 RICHER FEEDBACK 259
COMMUNICATION WITH A CHANGING NETWORK PROTOCOL 263
9.1 MODEL OF COMMUNICATION UNDER A CHANGING NETWORK PROTOCOL . 264 9.1.1
SETTING AND GOAL OF COMMUNICATION 264
9.1.2 MODEL OF NETWORK PROTOCOLS AND BOUNDED CHANGES . . . 267 9.2
DECODING MESSAGES SENT UNDER A MODIFIED NETWORK PROTOCOL . 271 9.2.1
ALGORITHMS FOR DETERMINISTIC EXTRACTORS AND INVERTING TRANSDUCERS 271
9.2.2 THE USER DECODING STRATEGY AND ITS IMPLEMENTATION . . 278 9.2.3
ANALYSIS OF THE USER DECODING STRATEGY 281
9.3 COMMUNICATION ACROSS AN UNRELIABLE NETWORK 284
9.3.1 A REVIEW OF THE KEY SUB-PROTOCOLS OF TCP 285
9.3.2 A MODIFIED END-USER SCHEME FOR RELIABLE COMMUNI- CATION 293
9.3.3 ANALYSIS OF THE MODIFIED STOP AND WAIT SCHEME . . . 302 9.3.4 AN
IMPROVED END-USER SCHEME FOR RELIABLE COMMUNI- CATION 316
9.4 ON EXTENDING THE SCHEMES TO NETWORKS CONNECTING MANY USERS 326 9.4.1
APPROACHES FOR PROTOCOLS USING THE SAME ADDRESSES . . 327 9.4.2
APPROACHES FOR PROTOCOLS USING DIFFERENT ADDRESSES . . 329
IMAGE 5
CONTENTS XIX
10 CONCLUSIONS AND DIRECTIONS FOR FUTURE WORK 331
10.1 DIRECTIONS FOR FUTURE WORK 332
10.1.1 CONCRETE UNIVERSAL SYSTEMS 333
10.1.2 REDUCING THE OVERHEAD OF CONCRETE SYSTEMS 334 10.1.3 CONNECTIONS
TO THE USABILITY OF COMPUTER INTERFACES . . 336
A BACKGROUND ON PROBABILITY 343
A.I FUNDAMENTALS OF DISCRETE PROBABILITY 343
A.2 INEQUALITIES 344
A.2.1 THE BASICS: UNION BOUND AND MARKOV'S INEQUALITY . . 344 A.2.2 TAIL
BOUNDS: HOEFFDING'S INEQUALITY 345
A.3 PROBABILITY FOR INFINITE EXECUTIONS 347
A.3.1 ON THE MEASURABILITY OF VARIOUS SETS OF EXECUTIONS . . 347 A.3.2
THE BOREL-CANTELLI LEMMA 348
B INTERACTIVE PROOFS 351
B.I INTRODUCTION 351
B.I.I MOTIVATION AND DEFINITIONS 352
B.1.2 EXAMPLE: INTERACTIVE PROOFS FOR GRAPH NON-ISOMOR- PHISM 355
B.1.3 THE COMPLEXITY OF THE PROVER 356
B.2 INTERACTIVE PROOFS FOR PSPACE 358
B.2.1 POLYNOMIAL ENCODINGS 359
B.2.2 ARITHMETIZATION 361
B.2.3 THE SUM-CHECK PROTOCOL 361
B.2.4 INTERACTIVE PROOFS FOR QUANTIFIED BOOLEAN FORMULA VA- LIDITY 366
C GAME THEORY 373
C.I ZERO-SUM GAMES AND THE MIN-MAX THEOREM 373
C.I.I DEFINITIONS 373
C.I.2 BASIC MULTIPLICATIVE WEIGHTS STRATEGY 374
C.I.3 THE MIN-MAX THEOREM AND LOOMIS' COROLLARY . . . 377 C.2
NONSTOCHASTIC BANDITS: GAMES WITH EXPLORATION 378
C.2.1 ESTIMATING THE REWARD IN THE BANDIT SETTING 379
C.2.2 OPTIMIZING THE REWARD IN THE LIMIT 384
BIBLIOGRAPHY 387 |
| any_adam_object | 1 |
| author | Juba, Brendan |
| author_facet | Juba, Brendan |
| author_role | aut |
| author_sort | Juba, Brendan |
| author_variant | b j bj |
| building | Verbundindex |
| bvnumber | BV039835993 |
| classification_rvk | ST 306 |
| ctrlnum | (OCoLC)768569323 (DE-599)DNB1013760395 |
| dewey-full | 004.62 004.69 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.62 004.69 |
| dewey-search | 004.62 004.69 |
| dewey-sort | 14.62 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV039835993</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120412</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">120124s2011 d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">11,N30</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">12,A03</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1013760395</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642232961</subfield><subfield code="c">Pp. : EUR 106.95 (DE, freier Pr.), ca. sfr 143.50 (freier Pr.)</subfield><subfield code="9">978-3-642-23296-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642232965</subfield><subfield code="9">3-642-23296-5</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642232961</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 80084447</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)768569323</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1013760395</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.62</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.69</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 306</subfield><subfield code="0">(DE-625)143654:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Juba, Brendan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Universal semantic communication</subfield><subfield code="c">Brendan Juba</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIX, 397 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">25 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Methode</subfield><subfield code="0">(DE-588)4333722-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Universalsprache</subfield><subfield code="0">(DE-588)4186923-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mensch-Maschine-Kommunikation</subfield><subfield code="0">(DE-588)4125909-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Semantisches Netz</subfield><subfield code="0">(DE-588)4242662-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computerunterstützte Kommunikation</subfield><subfield code="0">(DE-588)4535905-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Lerntheorie</subfield><subfield code="0">(DE-588)4701014-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Semantik</subfield><subfield code="0">(DE-588)4054490-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kommunikationsprotokoll</subfield><subfield code="0">(DE-588)4128252-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Mensch-Maschine-Kommunikation</subfield><subfield code="0">(DE-588)4125909-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kommunikationsprotokoll</subfield><subfield code="0">(DE-588)4128252-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Semantik</subfield><subfield code="0">(DE-588)4054490-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Universalsprache</subfield><subfield code="0">(DE-588)4186923-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Algorithmische Lerntheorie</subfield><subfield code="0">(DE-588)4701014-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="6"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="7"><subfield code="a">Formale Methode</subfield><subfield code="0">(DE-588)4333722-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Computerunterstützte Kommunikation</subfield><subfield code="0">(DE-588)4535905-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Semantisches Netz</subfield><subfield code="0">(DE-588)4242662-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="t">Universal Semantic Communication</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3857272&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024695988&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024695988</subfield></datafield></record></collection> |
| id | DE-604.BV039835993 |
| illustrated | Illustrated |
| indexdate | 2024-07-21T00:21:52Z |
| institution | BVB |
| isbn | 9783642232961 3642232965 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024695988 |
| oclc_num | 768569323 |
| open_access_boolean | |
| owner | DE-739 DE-11 |
| owner_facet | DE-739 DE-11 |
| physical | XIX, 397 S. graph. Darst. 25 cm |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Springer |
| record_format | marc |
| spelling | Juba, Brendan Verfasser aut Universal semantic communication Brendan Juba Berlin ; Heidelberg Springer 2011 XIX, 397 S. graph. Darst. 25 cm txt rdacontent n rdamedia nc rdacarrier Literaturangaben Formale Methode (DE-588)4333722-3 gnd rswk-swf Universalsprache (DE-588)4186923-0 gnd rswk-swf Mensch-Maschine-Kommunikation (DE-588)4125909-9 gnd rswk-swf Semantisches Netz (DE-588)4242662-5 gnd rswk-swf Berechnungstheorie (DE-588)4005581-4 gnd rswk-swf Computerunterstützte Kommunikation (DE-588)4535905-2 gnd rswk-swf Algorithmische Lerntheorie (DE-588)4701014-9 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Semantik (DE-588)4054490-4 gnd rswk-swf Kommunikationsprotokoll (DE-588)4128252-8 gnd rswk-swf Mensch-Maschine-Kommunikation (DE-588)4125909-9 s Kommunikationsprotokoll (DE-588)4128252-8 s Semantik (DE-588)4054490-4 s Universalsprache (DE-588)4186923-0 s Berechnungstheorie (DE-588)4005581-4 s Algorithmische Lerntheorie (DE-588)4701014-9 s Komplexitätstheorie (DE-588)4120591-1 s Formale Methode (DE-588)4333722-3 s DE-604 Computerunterstützte Kommunikation (DE-588)4535905-2 s Semantisches Netz (DE-588)4242662-5 s 1\p DE-604 Erscheint auch als Online-Ausgabe Universal Semantic Communication X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3857272&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024695988&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Juba, Brendan Universal semantic communication Formale Methode (DE-588)4333722-3 gnd Universalsprache (DE-588)4186923-0 gnd Mensch-Maschine-Kommunikation (DE-588)4125909-9 gnd Semantisches Netz (DE-588)4242662-5 gnd Berechnungstheorie (DE-588)4005581-4 gnd Computerunterstützte Kommunikation (DE-588)4535905-2 gnd Algorithmische Lerntheorie (DE-588)4701014-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Semantik (DE-588)4054490-4 gnd Kommunikationsprotokoll (DE-588)4128252-8 gnd |
| subject_GND | (DE-588)4333722-3 (DE-588)4186923-0 (DE-588)4125909-9 (DE-588)4242662-5 (DE-588)4005581-4 (DE-588)4535905-2 (DE-588)4701014-9 (DE-588)4120591-1 (DE-588)4054490-4 (DE-588)4128252-8 |
| title | Universal semantic communication |
| title_auth | Universal semantic communication |
| title_exact_search | Universal semantic communication |
| title_full | Universal semantic communication Brendan Juba |
| title_fullStr | Universal semantic communication Brendan Juba |
| title_full_unstemmed | Universal semantic communication Brendan Juba |
| title_short | Universal semantic communication |
| title_sort | universal semantic communication |
| topic | Formale Methode (DE-588)4333722-3 gnd Universalsprache (DE-588)4186923-0 gnd Mensch-Maschine-Kommunikation (DE-588)4125909-9 gnd Semantisches Netz (DE-588)4242662-5 gnd Berechnungstheorie (DE-588)4005581-4 gnd Computerunterstützte Kommunikation (DE-588)4535905-2 gnd Algorithmische Lerntheorie (DE-588)4701014-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Semantik (DE-588)4054490-4 gnd Kommunikationsprotokoll (DE-588)4128252-8 gnd |
| topic_facet | Formale Methode Universalsprache Mensch-Maschine-Kommunikation Semantisches Netz Berechnungstheorie Computerunterstützte Kommunikation Algorithmische Lerntheorie Komplexitätstheorie Semantik Kommunikationsprotokoll |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3857272&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024695988&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT jubabrendan universalsemanticcommunication |