How the world computes: Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2012
|
| Schriftenreihe: | Lecture notes in computer science
7318 |
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | XVIII, 756 S. Ill., graph. Darst. |
| ISBN: | 3642308694 9783642308697 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV040244220 | ||
| 003 | DE-604 | ||
| 005 | 20120625 | ||
| 007 | t| | ||
| 008 | 120611s2012 gw ad|| |||| 10||| eng d | ||
| 015 | |a 12,N22 |2 dnb | ||
| 016 | 7 | |a 1022401505 |2 DE-101 | |
| 020 | |a 3642308694 |9 3-642-30869-4 | ||
| 020 | |a 9783642308697 |c Pb. : ca. EUR 93.09 (DE) (freier Pr.), ca. EUR 95.70 (AT) (freier Pr.), ca. sfr 116.00 (freier Pr.) |9 978-3-642-30869-7 | ||
| 024 | 3 | |a 9783642308697 | |
| 028 | 5 | 2 | |a Best.-Nr.: 86114367 |
| 035 | |a (OCoLC)796275960 | ||
| 035 | |a (DE-599)DNB1022401505 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-706 |a DE-83 |a DE-91G |a DE-11 | ||
| 082 | 0 | |a 004.0151 |2 22/ger | |
| 084 | |a 004 |2 sdnb | ||
| 084 | |a 510 |2 sdnb | ||
| 245 | 1 | 0 | |a How the world computes |b Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings |c S. Barry Cooper ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2012 | |
| 300 | |a XVIII, 756 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 7318 | |
| 650 | 0 | 7 | |a Turing-Maschine |0 (DE-588)4203525-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungstheorie |0 (DE-588)4005581-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2012 |z Cambridge |2 gnd-content | |
| 689 | 0 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 1 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 0 | 2 | |a Turing-Maschine |0 (DE-588)4203525-9 |D s |
| 689 | 0 | 3 | |a Berechnungstheorie |0 (DE-588)4005581-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Cooper, Stuart B. |d 1943-2015 |e Sonstige |0 (DE-588)133309096 |4 oth | |
| 711 | 2 | |a CiE |n 8. |d 2012 |c Cambridge |j Sonstige |0 (DE-588)1023233452 |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-642-30870-3 |
| 830 | 0 | |a Lecture notes in computer science |v 7318 |w (DE-604)BV000000607 |9 7318 | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=4040570&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=025100348&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-025100348 | |
Datensatz im Suchindex
| _version_ | 1820875388862070784 |
|---|---|
| adam_text |
IMAGE 1
T A B L E O F C O N T E N T S
ORDINAL ANALYSIS AND THE INFINITE RAMSEY THEOREM 1
BAHAREH AFSHARI AND MICHAEL RATHJEN
CURIOUSER AND CURIOUSER: THE LINK BETWEEN INCOMPRESSIBILITY AND
COMPLEXITY 11
ERIC ALLENDER
INFORMATION AND LOGICAL DISCRIMINATION 17
PATRICK ALIO
ROBUSTNESS OF LOGICAL DEPTH 29
LUIS ANTUNES, ANDRE SOUTO. AND ANDREIA TEIXEIRA
TURING'S NORMAL NUMBERS: TOWARDS RANDOMNESS 35
VERONICA BECHER
LOGIC OF RULER AND COMPASS CONSTRUCTIONS 46
MICHAEL BEESON
ON THE COMPUTATIONAL CONTENT OF THE BROUWER FIXED POINT THEOREM . . . 56
VASCO BRATTKA, STEPHANA LE ROUX, AND ARNO PAULY
SQUARE ROOTS AND POWERS IN CONSTRUCTIVE BANACH ALGEBRA THEORY 68
DOUGLAS S. BRIDGES AND ROBIN S. HAVEA
THE MATE-IN-??, PROBLEM OF INFINITE CHESS IS DECIDABLE 78
DAN BRUMLEVE, JOEL DAVID HAMKINS, AND PHILIPP SCHLICHT
A NOTE ON RAMSEY THEOREMS AND TURING JUMPS 89
LORENZO CARLUCCI AND KONRAD ZDANOUISKI
AUTOMATIC FUNCTIONS, LINEAR TIME AND LEARNING 96
JOHN CASE. SANJAY JAIN, SAMUEL SEAH. AND FRANK STEPHAN
AN TJNDECIDABLE NESTED RECURRENCE RELATION 107
MARCEL CELAYA AND FRANK RUSKEY
HARD INSTANCES OF ALGORITHMS AND PROOF SYSTEMS 118
YIJIA CHEN, JORG FLUM, AND MORITZ MIILLER
O N MATHIAS GENERIC SETS 129
PETER A. CHOLAK, DARNIR D. DZHAFAROV, AND JEFFRY L. HIRST
HTTP://D-NB.INFO/1022401505
IMAGE 2
XIV TABLE OF CONTENTS
COMPLEXITY OF DEEP INFERENCE VIA ATOMIC FLOWS 139
ANUPAM DAS
CONNECTING PARTIAL WORDS AND REGULAR LANGUAGES 151
JIIRGEN DASSOW, FLORIN MANEA, AND ROBERT MERCA§
RANDOMNESS, COMPUTATION AND MATHEMATICS 162
ROD DOWNEY
LEARNING, SOCIAL INTELLIGENCE AND THE TURING TEST: WHY AN
"OUT-OF-THE-BOX" TURING MACHINE WILL NOT PASS THE TURING TEST 182
BRUCE EDMONDS AND CARLOS GERSHENSON
CONFLUENCE IN D A T A REDUCTION: BRIDGING GRAPH TRANSFORMATION AND
KERNELIZATION 193
HARTMUT EHIIG, CLAUDIA ERMEL, FALK HIIFFNER, ROLF NIEDERMEIER, AND OLGA
RUNGE
HIGHNESS AND LOCAL NONCAPPABILITY 203
CHENGLING FANG, WANG SHENLING, AND GUOHUA W U
TURING PROGRESSIONS AND THEIR WELL-ORDERS 212
DAVID FERNANDEZ DUQUE AND JOOST J. JOOSTEN
A SHORT NOTE ON SPECTOR'S PROOF OF CONSISTENCY OF ANALYSIS 222
FERNANDO FERREIRA
SETS OF SIGNALS, INFORMATION FLOW, AND FOLKTALES 228
MARK ALAN FINLAYSON
ON THE FOUNDATIONS AND PHILOSOPHY OF INFO-METRICS 237
AMOS GOLAN
ON MATHEMATICIANS WHO LIKED LOGIC: THE CASE OF MAX NEWMAN 245 IVOR
GRATTAN-GUINNESS
DENSITIES AND ENTROPIES IN CELLULAR AUTOMATA 253
PIERRE GUILLON AND CHARALAMPOS ZINOVIADIS
FOUNDATIONAL ANALYSES OF COMPUTATION 264
YURI GUREVICH
TURING MACHINE-INSPIRED COMPUTER SCIENCE RESULTS 276
JURIS HARTMANIS
NP-HARDNESS AND FIXED-PARAMETER TRACTABILITY OF REALIZING DEGREE
SEQUENCES WITH DIRECTED ACYCLIC GRAPHS 283
SEPP HARTUNG AND ANDRE NICHTERLEIN
A DIRECT PROOF OF WIENER'S THEOREM 293
MATTHEW HENDTLASS AND PETER SCHUSTER
IMAGE 3
TABLE OF CONTENTS X V
EFFECTIVE STRONG NULLNESS AND EFFECTIVELY CLOSED SETS 303
KOJIRO HIGUCHI AND TAKAYUKI KIHARA
WORD AUTOMATICITY OF TREE AUTOMATIC SCATTERED LINEAR ORDERINGS IS
DECIDABLE 313
MARTIN HUSCHENBETT
ON THE RELATIVE SUCCINCTNESS OF TWO EXTENSIONS BY DEFINITIONS OF
MULTIMODAL LOGIC 323
WIEBE VAN DER HOEK, PETAR ILIEV, AND BARTELD KOOI
ON IMMORTAL CONFIGURATIONS IN TURING MACHINES 334
EMMANUEL JEANDEL
. A SLIME MOLD SOLVER FOR LINEAR PROGRAMMING PROBLEMS 344
ANDERS JOHANNSON AND JAMES ZOU
MULTI-SCALE MODELING OF GENE REGULATION OF MORPHOGENESIS 355
JAAP A. KAANDORP, DANIEL BOTMAN. CARLOS TAMULONIS. AND ROLAND DRIES
TREE-AUTOMATIC WELL-FOUNDED TREES 363
ALEXANDER KARTZOW, JIAMOU LIU. AND MARKUS LOHREY
INFINITE GAMES AND TRANSFINITE RECURSION OF MULTIPLE INDUCTIVE
DEFINITIONS 374
KEISUKE YOSHII AND KAZUYUKI TANAKA
A HIERARCHY OF IMMUNITY AND DENSITY FOR SETS OF REALS 384
TAKAYUKI KIHARA
HOW MUCH RANDOMNESS IS NEEDED FOR STATISTICS? 395
BJ0RN KJOS-HANSSEN. ANTOINE TAVENEAUX, AND NEIL THAPEN
TOWARDS A THEORY OF INFINITE TIME BLUM-SHUB-SMALE MACHINES 405
PETER KOEPKE AND BENJAMIN SEYFFERTH
TURING PATTERN FORMATION WITHOUT DIFFUSION 416
SHIGERU KONDO
DEGREES OF TOTAL ALGORITHMS VERSUS DEGREES OF HONEST FUNCTIONS 422 LARS
KRISTIANSEN
A 5 N - O(N ) LOWER BOUND ON THE CIRCUIT SIZE OVER U2 OF A LINEAR
BOOLEAN FUNCTION 432
ALEXANDER S. KULIKOV, OLGA MELANICH, AND IVAN MIHAJLIN
LOCAL INDUCTION AND PROVABLY TOTAL COMPUTABLE FUNCTIONS: A CASE STUDY
440
ANDRES CORDON-FRANCO AND F. FELIX LARA-MARTIN
IMAGE 4
XVI TABLE OF CONTENTS
W H A T IS TURING'S COMPARISON BETWEEN MECHANISM AND WRITING WORTH? 450
JEAN LASSEGUE AND GIUSEPPE LONGO
SUBSTITUTIONS AND STRONGLY DETERMINISTIC TILESETS 462
BASTIEN LE GLOANNEC AND NICOLAS OLLINGER
THE COMPUTING SPACETIME 472
FOTINI MARKOPOULOU
UNIFIABILITY AND ADMISSIBILITY IN FINITE ALGEBRAS 485
GEORGE METCALFE AND CHRISTOPH ROTHLISBERGER
NATURAL SIGNS 496
RUTH GARRETT MILLIKAN
CHARACTERISTICS OF MINIMAL EFFECTIVE PROGRAMMING SYSTEMS 507
SAMUEL E. MOELIUS III
AFTER TURING: MATHEMATICAL MODELLING IN THE BIOMEDICAL AND SOCIAL
SCIENCES: FROM ANIMAL COAT PATTERNS TO BRAIN TUMOURS TO SAVING MARRIAGES
517
JAMES D. MURRAY
EXISTENCE OF FASTER T H A N LIGHT SIGNALS IMPLIES HYPERCOMPUTATION
ALREADY IN SPECIAL RELATIVITY 528
PETER NEMETI AND GERGELY SZEKELY
TURING COMPUTABLE EMBEDDINGS AND CODING FAMILIES OF SETS 539
VICTOR A. OCASIO-GONZDLEZ
ON THE BEHAVIOR OF TILE ASSEMBLY SYSTEM A T HIGH TEMPERATURES 549
SHINNOSUKE SEKI AND YASUSHI OKUNO
ABSTRACT PARTIAL CYLINDRICAL ALGEBRAIC DECOMPOSITION I: T H E LIFTING-
PHASE 560
GRANT OLNEY PASSMORE AND PAUL B. JACKSON
MULTI-VALUED FUNCTIONS IN COMPUTABILITY THEORY 571
A M O PAULY
RELATIVE RANDOMNESS FOR MARTIN-LOF RANDOM SETS 581
NINGNING PENG, KOJIRO HIGUCHI, TAKESHI YAMAZAKI, AND KAZUYUKI TANAKA
IMAGE 5
T A B L E O F C O N T E N T S X V I I
ON THE TARSKI-LINDENBAUM ALGEBRA OF THE CLASS OF ALL STRONGLY
CONSTRUCTIVIZABLE PRIME MODELS 589
MIKHAIL G. PERETYAT'KIN
LOWER BOUND ON WEIGHTS OF LARGE DEGREE THRESHOLD FUNCTIONS 599
VLADIMIR V. PODOLSKII
W H A T ARE COMPUTERS (IF THEY'RE NOT THINKING THINGS)? 609
JOHN PRESTON
COMPACTNESS AND THE EFFECTIVITY OF UNIFORMIZATION 616
ROBERT RETTINGER
ON THE COMPUTABILITY POWER OF MEMBRANE SYSTEMS WITH CONTROLLED MOBILITY
626
SHANKARA NARAYANAN KRISHNA, BOGDAN AMAN, AND GABRIEL CIOBANU
ON SHIFT SPACES WITH ALGEBRAIC STRUCTURE 636
VILLE SALO AND ILKKA TORMA
FINITE STATE VERIFIERS WITH CONSTANT RANDOMNESS 646
A.C. CEM SAY AND ABUZER YAKARYILMAZ
GAME ARGUMENTS IN COMPUTABILITY THEORY AND ALGORITHMIC INFORMATION
THEORY 655
ALEXANDER SHEN
TURING PATTERNS IN DESERTS 667
JONATHAN A. SHERRATT
SUBS3'MBOLIC COMPUTATION THEORY FOR THE HUMAN INTUITIVE PROCESSOR . .
675 PAUL SMOLENSKY
A CORRESPONDENCE PRINCIPLE FOR EXACT CONSTRUCTIVE DIMENSION 686
LUDUIIG STAIGER
LOW N BOOLEAN SUBALGEBRAS 696
REBECCA M. STEINER
BRINGING UP TURING'S 'CHILD-MACHINE' 703
SUSAN G. STERRETT
IS TURING'S THESIS THE CONSEQUENCE OF A MORE GENERAL PHYSICAL PRINCIPLE?
714
MATTHEW P. SZUDZIK
SOME NATURAL ZERO ONE LAWS FOR ORDINALS BELOW O ANDREAS WEIERMANN AND
ALAN R,. WOODS 7 2 3
IMAGE 6
XVIII TABLE OF CONTENTS
O N THE ROAD TO THINKING MACHINES: INSIGHTS AND IDEAS 733
J I F I WIEDERMANN
MAKING SOLOMONOFF INDUCTION EFFECTIVE: OR: YOU CAN LEARN W H A T YOU CAN
BOUND 745
JORG ZIMRNERMANN AND A R M I N B. CREMERS
A U T H O R I N D E X 755 |
| any_adam_object | 1 |
| author_GND | (DE-588)133309096 |
| building | Verbundindex |
| bvnumber | BV040244220 |
| classification_rvk | SS 4800 |
| ctrlnum | (OCoLC)796275960 (DE-599)DNB1022401505 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV040244220</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120625</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">120611s2012 gw ad|| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">12,N22</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1022401505</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642308694</subfield><subfield code="9">3-642-30869-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642308697</subfield><subfield code="c">Pb. : ca. EUR 93.09 (DE) (freier Pr.), ca. EUR 95.70 (AT) (freier Pr.), ca. sfr 116.00 (freier Pr.)</subfield><subfield code="9">978-3-642-30869-7</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642308697</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 86114367</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)796275960</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1022401505</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-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">How the world computes</subfield><subfield code="b">Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings</subfield><subfield code="c">S. Barry Cooper ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 756 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="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7318</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</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">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2012</subfield><subfield code="z">Cambridge</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cooper, Stuart B.</subfield><subfield code="d">1943-2015</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)133309096</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">CiE</subfield><subfield code="n">8.</subfield><subfield code="d">2012</subfield><subfield code="c">Cambridge</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1023233452</subfield><subfield code="4">oth</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-642-30870-3</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7318</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">7318</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=4040570&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=025100348&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-025100348</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2012 Cambridge gnd-content |
| genre_facet | Konferenzschrift 2012 Cambridge |
| id | DE-604.BV040244220 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:14:51Z |
| institution | BVB |
| institution_GND | (DE-588)1023233452 |
| isbn | 3642308694 9783642308697 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-025100348 |
| oclc_num | 796275960 |
| open_access_boolean | |
| owner | DE-706 DE-83 DE-91G DE-BY-TUM DE-11 |
| owner_facet | DE-706 DE-83 DE-91G DE-BY-TUM DE-11 |
| physical | XVIII, 756 S. Ill., graph. Darst. |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | How the world computes Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings S. Barry Cooper ... (eds.) Berlin [u.a.] Springer 2012 XVIII, 756 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 7318 Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Berechnungstheorie (DE-588)4005581-4 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2012 Cambridge gnd-content Berechnungskomplexität (DE-588)4134751-1 s Berechenbarkeit (DE-588)4138368-0 s Turing-Maschine (DE-588)4203525-9 s Berechnungstheorie (DE-588)4005581-4 s DE-604 Cooper, Stuart B. 1943-2015 Sonstige (DE-588)133309096 oth CiE 8. 2012 Cambridge Sonstige (DE-588)1023233452 oth Erscheint auch als Online-Ausgabe 978-3-642-30870-3 Lecture notes in computer science 7318 (DE-604)BV000000607 7318 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=4040570&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=025100348&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | How the world computes Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings Lecture notes in computer science Turing-Maschine (DE-588)4203525-9 gnd Berechnungstheorie (DE-588)4005581-4 gnd Berechenbarkeit (DE-588)4138368-0 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4203525-9 (DE-588)4005581-4 (DE-588)4138368-0 (DE-588)4134751-1 (DE-588)1071861417 |
| title | How the world computes Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings |
| title_auth | How the world computes Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings |
| title_exact_search | How the world computes Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings |
| title_full | How the world computes Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings S. Barry Cooper ... (eds.) |
| title_fullStr | How the world computes Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings S. Barry Cooper ... (eds.) |
| title_full_unstemmed | How the world computes Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings S. Barry Cooper ... (eds.) |
| title_short | How the world computes |
| title_sort | how the world computes turing centenary conference and 8th conference on computability in europe cie 2012 cambridge uk june 18 23 2012 proceedings |
| title_sub | Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18 - 23, 2012 ; proceedings |
| topic | Turing-Maschine (DE-588)4203525-9 gnd Berechnungstheorie (DE-588)4005581-4 gnd Berechenbarkeit (DE-588)4138368-0 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Turing-Maschine Berechnungstheorie Berechenbarkeit Berechnungskomplexität Konferenzschrift 2012 Cambridge |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=4040570&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=025100348&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT cooperstuartb howtheworldcomputesturingcentenaryconferenceand8thconferenceoncomputabilityineuropecie2012cambridgeukjune18232012proceedings AT ciecambridge howtheworldcomputesturingcentenaryconferenceand8thconferenceoncomputabilityineuropecie2012cambridgeukjune18232012proceedings |