Algorithmic adventures: from knowledge to magic
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2009
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIII, 363 S. Ill., graph. Darst. |
| ISBN: | 9783540859857 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035342498 | ||
| 003 | DE-604 | ||
| 005 | 20100511 | ||
| 007 | t | ||
| 008 | 090303s2009 gw ad|| |||| 00||| eng d | ||
| 015 | |a 08,N44,0024 |2 dnb | ||
| 016 | 7 | |a 990736180 |2 DE-101 | |
| 020 | |a 9783540859857 |9 978-3-540-85985-7 | ||
| 024 | 3 | |a 9783540859857 | |
| 028 | 5 | 2 | |a 12245314 |
| 035 | |a (OCoLC)269435311 | ||
| 035 | |a (DE-599)DNB990736180 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-703 |a DE-634 |a DE-188 |a DE-11 | ||
| 050 | 0 | |a QA76.9 | |
| 082 | 0 | |a 005.1 |2 22 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Hromkovič, Juraj |d 1958- |e Verfasser |0 (DE-588)123212898 |4 aut | |
| 245 | 1 | 0 | |a Algorithmic adventures |b from knowledge to magic |c Juraj Hromkovič |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2009 | |
| 300 | |a XIII, 363 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Algorithmus | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Komplexitätstheorie | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |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 Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 2 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-540-85986-4 |
| 856 | 4 | 2 | |m Digitalisierung UB Bayreuth |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017146774&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017146774 | ||
Datensatz im Suchindex
| _version_ | 1804138659398549504 |
|---|---|
| adam_text | Contents
1
A Short Story About the Development of
Computer Science or Why Computer Science Is
Not a Computer Driving Licence
................ 1
1.1
What Do We Discover Here?
................... 1
1.2
Fundamentals of Science
....................... 2
1.3
The End of Euphoria
.......................... 19
1.4
The History of Computer Science
............... 24
1.5
Summary
.................................... 33
2
Algorithmics, or What Have Programming and
Baking in Common?
............................. 37
2.1
What Do We Find out Here?
................... 37
2.2
Algorithmic Cooking
.......................... 38
2.3
What About Computer Algorithms?
............ 45
2.4
Unintentionally Never-Ending Execution
......... 61
2.5
Summary
.................................... 69
3
Infinity Is Not Equal to Infinity, or Why Infinity
Is Infinitely Important in Computer Science
..... 73
3.1
Why Do We Need Infinity?
.................... 73
3.2
Cantor s Concept
............................. 77
3.3
Different Infinite Sizes
.........................107
3.4
Summary
....................................114
XII Contents
4 Limits
of Computability or Why Do There Exist
Tasks That Cannot Be Solved Automatically by
Computers
......................................117
4.1
Aim
........................................117
4.2
How Many Programs Exist?
....................118
4.3
YES or NO, That Is the Question
...............125
4.4
Reduction Method
............................133
4.5
Summary
....................................155
5
Complexity Theory or What to Do When the
Energy of the Universe Doesn t Suffice for
Performing a Computation?
.....................161
5.1
Introduction to Complexity Theory
............. 161
5.2
How to Measure Computational Complexity?
.....163
5.3
Why Is the Complexity Measurement Useful?
.....169
5.4
Limits of Tractability
......................... 174
5.5
How Do We Recognize a Hard Problem?
.........178
5.6
Help, I Have a Hard Problem
...................190
5.7
Summary
.................................... 195
6
Randomness in Nature and as a Source of
Efficiency in Algorithmics
.......................201
6.1
Aims
........................................ 201
6.2
Does True Randomness Exist?
.................. 203
6.3
Abundant Witnesses Are Useful
................ 210
6.4
High Reliabilities
............................. 228
6.5
What Are Our Main Discoveries Here?
.......... 234
7
Cryptography, or How to Transform Drawbacks
into Advantages
.................................239
7.1
A Magical Science of the Present Time
..........239
7.2
Prehistory of Cryptography
....................241
7.3
When Is a Cryptosystem Secure?
...............246
7.4
Symmetric Cryptosystems
.....................249
7.5
How to Agree on a Secret in Public Gossip?
......253
7.6
Public-Key Cryptosystems
.....................260
7.7
Milestones of Cryptography
....................272
Contents XIII
8 Computing
with
DNA
Molecules, or Biological
Computer Technology on the Horizon
...........277
8.1
The Story So Far
.............................277
8.2
How to Transform a Chemical Lab into
a
DNA
Computer
...................................282
8.3
Adleman s Experiment
........................288
8.4
The Future of
DNA
Computing
................296
9
Quantum Computers, or Computing in the
Wonderland of Particles
.........................299
9.1
Prehistory
................................... 299
9.2
The Wonderland of Quantum Mechanics
......... 302
9.3
How to Compute in the World of Particles?
...... 309
9.4
The Future of Quantum Computing
............. 320
10
How to Make Good Decisions for an Unknown
Future or How to Foil an Adversary
.............325
10.1
What Do We Want to Discover Here?
...........325
10.2
Quality Measurement of Online Algorithms
......327
10.3
A Randomized Online Strategy
.................338
10.4
Summary
....................................356
References
..........................................359
Index
...............................................361
|
| any_adam_object | 1 |
| author | Hromkovič, Juraj 1958- |
| author_GND | (DE-588)123212898 |
| author_facet | Hromkovič, Juraj 1958- |
| author_role | aut |
| author_sort | Hromkovič, Juraj 1958- |
| author_variant | j h jh |
| building | Verbundindex |
| bvnumber | BV035342498 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9 |
| callnumber-search | QA76.9 |
| callnumber-sort | QA 276.9 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)269435311 (DE-599)DNB990736180 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| 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>01928nam a2200541 c 4500</leader><controlfield tag="001">BV035342498</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100511 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090303s2009 gw ad|| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">08,N44,0024</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">990736180</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540859857</subfield><subfield code="9">978-3-540-85985-7</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783540859857</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">12245314</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)269435311</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB990736180</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</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">Hromkovič, Juraj</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123212898</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmic adventures</subfield><subfield code="b">from knowledge to magic</subfield><subfield code="c">Juraj Hromkovič</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 363 S.</subfield><subfield code="b">Ill., graph. Darst.</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="650" ind1=" " ind2="4"><subfield code="a">Algorithmus</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Komplexitätstheorie</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><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="z">978-3-540-85986-4</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bayreuth</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=017146774&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017146774</subfield></datafield></record></collection> |
| id | DE-604.BV035342498 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:31:42Z |
| institution | BVB |
| isbn | 9783540859857 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017146774 |
| oclc_num | 269435311 |
| open_access_boolean | |
| owner | DE-703 DE-634 DE-188 DE-11 |
| owner_facet | DE-703 DE-634 DE-188 DE-11 |
| physical | XIII, 363 S. Ill., graph. Darst. |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Springer |
| record_format | marc |
| spelling | Hromkovič, Juraj 1958- Verfasser (DE-588)123212898 aut Algorithmic adventures from knowledge to magic Juraj Hromkovič Berlin [u.a.] Springer 2009 XIII, 363 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Algorithmus Informatik Komplexitätstheorie Computer algorithms Algorithmus (DE-588)4001183-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Informatik (DE-588)4026894-9 s Komplexitätstheorie (DE-588)4120591-1 s Erscheint auch als Online-Ausgabe 978-3-540-85986-4 Digitalisierung UB Bayreuth application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017146774&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Hromkovič, Juraj 1958- Algorithmic adventures from knowledge to magic Algorithmus Informatik Komplexitätstheorie Computer algorithms Algorithmus (DE-588)4001183-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4120591-1 (DE-588)4026894-9 |
| title | Algorithmic adventures from knowledge to magic |
| title_auth | Algorithmic adventures from knowledge to magic |
| title_exact_search | Algorithmic adventures from knowledge to magic |
| title_full | Algorithmic adventures from knowledge to magic Juraj Hromkovič |
| title_fullStr | Algorithmic adventures from knowledge to magic Juraj Hromkovič |
| title_full_unstemmed | Algorithmic adventures from knowledge to magic Juraj Hromkovič |
| title_short | Algorithmic adventures |
| title_sort | algorithmic adventures from knowledge to magic |
| title_sub | from knowledge to magic |
| topic | Algorithmus Informatik Komplexitätstheorie Computer algorithms Algorithmus (DE-588)4001183-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Informatik (DE-588)4026894-9 gnd |
| topic_facet | Algorithmus Informatik Komplexitätstheorie Computer algorithms |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017146774&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT hromkovicjuraj algorithmicadventuresfromknowledgetomagic |