Verfügbarkeit: Limits of Computation

Limits of Computation: From a Programming Perspective

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Reus, Bernhard 1965- (VerfasserIn)
Format:	Elektronisch E-Book
Sprache:	English
Veröffentlicht:	Cham Springer International Publishing 2016
Ausgabe:	1st ed. 2016
Schriftenreihe:	Undergraduate Topics in Computer Science
Schlagworte:	Computer science Algorithms Algorithm Analysis and Problem Complexity Mathematics of Algorithmic Complexity Informatik Mathematik Algorithmische Programmiersprache Algorithmische Programmierung
Online-Zugang:	BTU01 FHA01 FHI01 FHM01 FHN01 FHR01 FKE01 FRO01 HTW01 UBG01 UBM01 UBR01 UBT01 UBW01 UER01 UPA01 Volltext Inhaltsverzeichnis Abstract
Beschreibung:	1 Online-Ressource (XVIII, 348 p. 80 illus)
ISBN:	9783319278896
ISSN:	1863-7310
DOI:	10.1007/978-3-319-27889-6

Internformat

MARC


LEADER	00000nmm a2200000zc 4500
001	BV043503978
003	DE-604
005	20230203
007	cr\|uuu---uuuuu
008	160411s2016 \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d
020			\|a 9783319278896 \|c Online \|9 978-3-319-27889-6
024	7		\|a 10.1007/978-3-319-27889-6 \|2 doi
035			\|a (ZDB-2-SCS)978-3-319-27889-6
035			\|a (OCoLC)946155827
035			\|a (DE-599)BVBBV043503978
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
049			\|a DE-355 \|a DE-523 \|a DE-19 \|a DE-Aug4 \|a DE-898 \|a DE-861 \|a DE-M347 \|a DE-573 \|a DE-859 \|a DE-703 \|a DE-473 \|a DE-29 \|a DE-20 \|a DE-739 \|a DE-634 \|a DE-92
082	0		\|a 005.1 \|2 23
084			\|a ST 257 \|0 (DE-625)143630: \|2 rvk
084			\|a ST 230 \|0 (DE-625)143617: \|2 rvk
100	1		\|a Reus, Bernhard \|d 1965- \|e Verfasser \|0 (DE-588)1111581339 \|4 aut
245	1	0	\|a Limits of Computation \|b From a Programming Perspective \|c by Bernhard Reus
250			\|a 1st ed. 2016
264		1	\|a Cham \|b Springer International Publishing \|c 2016
300			\|a 1 Online-Ressource (XVIII, 348 p. 80 illus)
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	0		\|a Undergraduate Topics in Computer Science \|x 1863-7310
650		4	\|a Computer science
650		4	\|a Algorithms
650		4	\|a Algorithm Analysis and Problem Complexity
650		4	\|a Mathematics of Algorithmic Complexity
650		4	\|a Informatik
650	0	7	\|a Mathematik \|0 (DE-588)4037944-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmische Programmiersprache \|0 (DE-588)4141876-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmische Programmierung \|0 (DE-588)4293504-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Informatik \|0 (DE-588)4026894-9 \|2 gnd \|9 rswk-swf
689	0	0	\|a Informatik \|0 (DE-588)4026894-9 \|D s
689	0	1	\|a Mathematik \|0 (DE-588)4037944-9 \|D s
689	0	2	\|a Algorithmische Programmiersprache \|0 (DE-588)4141876-1 \|D s
689	0		\|5 DE-604
689	1	0	\|a Algorithmische Programmierung \|0 (DE-588)4293504-0 \|D s
689	1		\|8 1\p \|5 DE-604
776	0	8	\|i Erscheint auch als \|n Druckausgabe \|z 978-3-319-27887-2
856	4	0	\|u https://doi.org/10.1007/978-3-319-27889-6 \|x Verlag \|z URL des Erstveröffentlichers \|3 Volltext
856	4	2	\|m Springer Fremddatenuebernahme \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028920323&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
856	4	2	\|m Springer Fremddatenuebernahme \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028920323&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA \|3 Abstract
912			\|a ZDB-2-SCS
940	1		\|q ZDB-2-SCS_2016
999			\|a oai:aleph.bib-bvb.de:BVB01-028920323
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l BTU01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l FHA01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l FHI01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l FHM01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l FHN01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l FHR01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l FKE01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l FRO01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l HTW01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l UBG01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l UBM01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l UBR01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l UBT01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l UBW01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l UER01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-319-27889-6 \|l UPA01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext

Datensatz im Suchindex

_version_	1804176141232111616
adam_text	LIMITS OF COMPUTATION / REUS, BERNHARD : 2016 TABLE OF CONTENTS / INHALTSVERZEICHNIS FOREWORD LIMITS? WHAT LIMITS? PART I COMPUTABILITY PROBLEMS AND EFFECTIVE PROCEDURES THE WHILE-LANGUAGE SEMANTICS OF WHILE EXTENSIONS OF WHILE PROGRAMS AS DATA OBJECTS A SELF-INTERPRETER FOR WHILE AN UNDECIDABLE (NON-COMPUTABLE) PROBLEM MORE UNDECIDABLE PROBLEMS SELF-REFERENCING PROGRAMS THE CHURCH-TURING THESIS PART II COMPLEXITY MEASURING TIME USAGE COMPLEXITY CLASSES ROBUSTNESS OF P HIERARCHY THEOREMS FAMOUS PROBLEMS IN P COMMON PROBLEMS NOT KNOWN TO BE IN P THE ONE-MILLION-DOLLAR QUESTION HOW HARD IS A PROBLEM? COMPLETE PROBLEMS HOW TO SOLVE NP-COMPLETE PROBLEMS? PART III EMERGING NEW MODELS OF COMPUTATION – “GOING NANO” MOLECULAR COMPUTING QUANTUM COMPUTING APPENDIX A: FURTHER READING – COMPUTABILITY AND COMPLEXITY TEXTBOOKS GLOSSARY INDEX DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT. LIMITS OF COMPUTATION / REUS, BERNHARD : 2016 ABSTRACT / INHALTSTEXT THIS TEXTBOOK DISCUSSES THE MOST FUNDAMENTAL AND PUZZLING QUESTIONS ABOUT THE FOUNDATIONS OF COMPUTING. IN 23 LECTURE-SIZED CHAPTERS IT PROVIDES AN EXCITING TOUR THROUGH THE MOST IMPORTANT RESULTS IN THE FIELD OF COMPUTABILITY AND TIME COMPLEXITY, INCLUDING THE HALTING PROBLEM, RICE S THEOREM, KLEENE S RECURSION THEOREM, THE CHURCH-TURING THESIS, HIERARCHY THEOREMS, AND COOK-LEVIN S THEOREM. EACH CHAPTER CONTAINS CLASSROOM-TESTED MATERIAL, INCLUDING EXAMPLES AND EXERCISES. LINKS BETWEEN ADJACENT CHAPTERS PROVIDE A COHERENT NARRATIVE. FUNDAMENTAL RESULTS ARE EXPLAINED LUCIDLY BY MEANS OF PROGRAMS WRITTEN IN A SIMPLE, HIGH-LEVEL IMPERATIVE PROGRAMMING LANGUAGE, WHICH ONLY REQUIRES BASIC MATHEMATICAL KNOWLEDGE. THROUGHOUT THE BOOK, THE IMPACT OF THE PRESENTED RESULTS ON THE ENTIRE FIELD OF COMPUTER SCIENCE IS EMPHASISED. EXAMPLES RANGE FROM PROGRAM ANALYSIS TO NETWORKING, FROM DATABASE PROGRAMMING TO POPULAR GAMES AND PUZZLES. NUMEROUS BIOGRAPHICAL FOOTNOTES ABOUT THE FAMOUS SCIENTISTS WHO DEVELOPED THE SUBJECT ARE ALSO INCLUDED. LIMITS OF COMPUTATION OFFERS A THOROUGH, YET ACCESSIBLE, INTRODUCTION TO COMPUTABILITY AND COMPLEXITY FOR THE COMPUTER SCIENCE STUDENT OF THE 21ST CENTURY DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
any_adam_object	1
author	Reus, Bernhard 1965-
author_GND	(DE-588)1111581339
author_facet	Reus, Bernhard 1965-
author_role	aut
author_sort	Reus, Bernhard 1965-
author_variant	b r br
building	Verbundindex
bvnumber	BV043503978
classification_rvk	ST 257 ST 230
collection	ZDB-2-SCS
ctrlnum	(ZDB-2-SCS)978-3-319-27889-6 (OCoLC)946155827 (DE-599)BVBBV043503978
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
doi_str_mv	10.1007/978-3-319-27889-6
edition	1st ed. 2016
format	Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04332nmm a2200793zc 4500</leader><controlfield tag="001">BV043503978</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230203 </controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">160411s2016 \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319278896</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-319-27889-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-319-27889-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-3-319-27889-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)946155827</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043503978</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield><subfield code="a">DE-523</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 257</subfield><subfield code="0">(DE-625)143630:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Reus, Bernhard</subfield><subfield code="d">1965-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1111581339</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Limits of Computation</subfield><subfield code="b">From a Programming Perspective</subfield><subfield code="c">by Bernhard Reus</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2016</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer International Publishing</subfield><subfield code="c">2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVIII, 348 p. 80 illus)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Undergraduate Topics in Computer Science</subfield><subfield code="x">1863-7310</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics of Algorithmic Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Programmiersprache</subfield><subfield code="0">(DE-588)4141876-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmische Programmiersprache</subfield><subfield code="0">(DE-588)4141876-1</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">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</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">Druckausgabe</subfield><subfield code="z">978-3-319-27887-2</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</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=028920323&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</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=028920323&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Abstract</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2016</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028920323</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="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">FHI01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">FHM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">FHR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">FKE01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">HTW01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-27889-6</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection>
id	DE-604.BV043503978
illustrated	Not Illustrated
indexdate	2024-07-10T07:27:28Z
institution	BVB
isbn	9783319278896
issn	1863-7310
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-028920323
oclc_num	946155827
open_access_boolean
owner	DE-355 DE-BY-UBR DE-523 DE-19 DE-BY-UBM DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-M347 DE-573 DE-859 DE-703 DE-473 DE-BY-UBG DE-29 DE-20 DE-739 DE-634 DE-92
owner_facet	DE-355 DE-BY-UBR DE-523 DE-19 DE-BY-UBM DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-M347 DE-573 DE-859 DE-703 DE-473 DE-BY-UBG DE-29 DE-20 DE-739 DE-634 DE-92
physical	1 Online-Ressource (XVIII, 348 p. 80 illus)
psigel	ZDB-2-SCS ZDB-2-SCS_2016
publishDate	2016
publishDateSearch	2016
publishDateSort	2016
publisher	Springer International Publishing
record_format	marc
series2	Undergraduate Topics in Computer Science
spelling	Reus, Bernhard 1965- Verfasser (DE-588)1111581339 aut Limits of Computation From a Programming Perspective by Bernhard Reus 1st ed. 2016 Cham Springer International Publishing 2016 1 Online-Ressource (XVIII, 348 p. 80 illus) txt rdacontent c rdamedia cr rdacarrier Undergraduate Topics in Computer Science 1863-7310 Computer science Algorithms Algorithm Analysis and Problem Complexity Mathematics of Algorithmic Complexity Informatik Mathematik (DE-588)4037944-9 gnd rswk-swf Algorithmische Programmiersprache (DE-588)4141876-1 gnd rswk-swf Algorithmische Programmierung (DE-588)4293504-0 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Informatik (DE-588)4026894-9 s Mathematik (DE-588)4037944-9 s Algorithmische Programmiersprache (DE-588)4141876-1 s DE-604 Algorithmische Programmierung (DE-588)4293504-0 s 1\p DE-604 Erscheint auch als Druckausgabe 978-3-319-27887-2 https://doi.org/10.1007/978-3-319-27889-6 Verlag URL des Erstveröffentlichers Volltext Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028920323&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028920323&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Abstract 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Reus, Bernhard 1965- Limits of Computation From a Programming Perspective Computer science Algorithms Algorithm Analysis and Problem Complexity Mathematics of Algorithmic Complexity Informatik Mathematik (DE-588)4037944-9 gnd Algorithmische Programmiersprache (DE-588)4141876-1 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Informatik (DE-588)4026894-9 gnd
subject_GND	(DE-588)4037944-9 (DE-588)4141876-1 (DE-588)4293504-0 (DE-588)4026894-9
title	Limits of Computation From a Programming Perspective
title_auth	Limits of Computation From a Programming Perspective
title_exact_search	Limits of Computation From a Programming Perspective
title_full	Limits of Computation From a Programming Perspective by Bernhard Reus
title_fullStr	Limits of Computation From a Programming Perspective by Bernhard Reus
title_full_unstemmed	Limits of Computation From a Programming Perspective by Bernhard Reus
title_short	Limits of Computation
title_sort	limits of computation from a programming perspective
title_sub	From a Programming Perspective
topic	Computer science Algorithms Algorithm Analysis and Problem Complexity Mathematics of Algorithmic Complexity Informatik Mathematik (DE-588)4037944-9 gnd Algorithmische Programmiersprache (DE-588)4141876-1 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Informatik (DE-588)4026894-9 gnd
topic_facet	Computer science Algorithms Algorithm Analysis and Problem Complexity Mathematics of Algorithmic Complexity Informatik Mathematik Algorithmische Programmiersprache Algorithmische Programmierung
url	https://doi.org/10.1007/978-3-319-27889-6 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028920323&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028920323&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT reusbernhard limitsofcomputationfromaprogrammingperspective

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge