Verfügbarkeit: Computability theory

Computability theory:

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Cooper, Stuart B. 1943-2015 (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Boca Raton [u.a.] Chapman & Hall/CRC 2004
Schriftenreihe:	Chapman & Hall/CRC mathematics
Schlagworte:	Computable functions Berechenbare Funktion Berechnungstheorie
Online-Zugang:	Inhaltsverzeichnis
Beschreibung:	IX, 409 S. graph. Darst.
ISBN:	1584882379

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV019668177
003	DE-604
005	20190329
007	t
008	050121s2004 xxud\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 1584882379 \|9 1-58488-237-9
035			\|a (OCoLC)248800776
035			\|a (DE-599)BVBBV019668177
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
044			\|a xxu \|c XD-US
049			\|a DE-19 \|a DE-91G \|a DE-706 \|a DE-521 \|a DE-634 \|a DE-188 \|a DE-739 \|a DE-11
050		0	\|a QA9.59.C68 2004
082	0		\|a 511.3
082	0		\|a 511.3 22
084			\|a SK 130 \|0 (DE-625)143216: \|2 rvk
084			\|a SK 990 \|0 (DE-625)143278: \|2 rvk
084			\|a ST 134 \|0 (DE-625)143590: \|2 rvk
084			\|a 17,1 \|2 ssgn
084			\|a DAT 542f \|2 stub
100	1		\|a Cooper, Stuart B. \|d 1943-2015 \|e Verfasser \|0 (DE-588)133309096 \|4 aut
245	1	0	\|a Computability theory \|c S. Barry Cooper
264		1	\|a Boca Raton [u.a.] \|b Chapman & Hall/CRC \|c 2004
300			\|a IX, 409 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	0		\|a Chapman & Hall/CRC mathematics
650		4	\|a Computable functions
650	0	7	\|a Berechenbare Funktion \|0 (DE-588)4135762-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Berechnungstheorie \|0 (DE-588)4005581-4 \|2 gnd \|9 rswk-swf
689	0	0	\|a Berechenbare Funktion \|0 (DE-588)4135762-0 \|D s
689	0	1	\|a Berechnungstheorie \|0 (DE-588)4005581-4 \|D s
689	0		\|5 DE-604
856	4	2	\|m Digitalisierung UB Passau - ADAM Catalogue Enrichment \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012996455&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-012996455

Datensatz im Suchindex

_version_	1804133050536165376
adam_text	Contents Part I Computability and Unsolvable Problems 1 1 Hilbert and the Origins of Computability Theory 3 1.1 Algorithms and Algorithmic Content ...................... 3 1.2 Hilbert’s Programme ..................................... 5 1.3 Gödel and the Discovery of Incomputability .............. 7 1.4 Computability and Unsolvability in the Real World ....... 8 2 Models of Computability and the Church—Turing Thesis 11 2.1 The Recursive Functions ................................ 12 2.2 Church’s Thesis and the Computability of Sets and Relations 19 2.3 Unlimited Register Machines............................. 25 2.4 Turing’s Machines ...................................... 34 2.5 Church, Turing, and the Equivalence of Models........... 42 3 Language, Proof and Computable Functions 45 3.1 Peano Arithmetic and Its Models ........................ 45 3.2 What Functions Can We Describe in a Theory? ............ 56 4 Coding, Self-Reference and the Universal Turing Machine 61 4.1 Russell’s Paradox ...................................... 61 4.2 Gödel Numberings........................................ 62 4.3 A Universal Turing Machine ............................. 65 4.4 The Fixed Point Theorem................................. 66 4.5 Computable Approximations............................... 67 5 Enumerability and Computability 69 5.1 Basic Notions .......................................... 69 5.2 The Normal Form Theorem................................. 73 5.3 Incomputable Sets and the Unsolvability of the Halting Prob- lem for Turing Machines ..................................... 78 5.4 The Busy Beaver Function ............................... 81 6 The Search for Natural Examples of Incomputable Sets 87 6.1 The Ubiquitous Creative Sets............................ 88 6.2 Some Less Natural Examples of Incomputable Sets ........ 90 6.3 Hilbert’s Tenth Problem and the Search for Really Natural Examples................................................ 94 7 Comparing Computability and the Ubiquity of Creative Sets 101 7.1 Many-One Reducibility.................................. 101 7.2 The Non-Computable Universe and Many-One Degrees . . . 106 7.3 Creative Sets Revisited ............................... 112 8 Godel’s Incompleteness Theorem 117 8.1 Semi-Representability and C.E. Sets.................... 117 8.2 Incomputability and Godel’s Theorem.................... 122 9 Decidable and Undecidable Theories 127 9.1 PA is Undecidable...................................... 127 9.2 Other Undecidable Theories and Their Many-One Equivalence 128 9.3 Some Decidable Theories ............................... 132 Part II Incomputability and Information Content 137 10 Computing with Oracles 139 10.1 Oracle Turing Machines................................. 139 10.2 Relativising, and Listing the Partial Computable Functionals 142 10.3 Introducing the Turing Universe ....................... 144 10.4 Enumerating with Oracles, and the Jump Operator ....... 147 ՜ 10.5 The Arithmetical Hierarchy and Post’s Theorem.......... 154 10.6 The Structure of the Turing Universe .................. 161 11 Nondeterminism, Enumerations and Polynomial Bounds 173 11.1 Oracles versus Enumerations of Data .................. 173 11.2 Enumeration Reducibility and the Scott Model for Lambda Calculus .............................................. 180 11.3 The Enumeration Degrees and the Natural Embedding of the Turing Degrees......................................... 191 11.4 The Structure of T e and the Arithmetical Hierarchy... 199 11.5 The Medvedev Lattice................................... 202 11.6 Polynomial Bounds and P =? NP ........................ 205 Part III More Advanced Topics 217 12 Post’s Problem; Immunity and Priority 219 12.1 Information Content and Structure ..................... 219 12.2 Immunity Properties ................................... 226 12.3 Approximation and Priority ............................ 237 12.4 Sacks’ Splitting Theorem and Cone Avoidance ............ 246 12.5 Minimal Pairs and Extensions of Embeddings ............. 252 12.6 The II3 Theory — Information Content Regained .......... 260 12.7 Higher Priority and Maximal Sets ....................... 266 13 Forcing and Category 273 13.1 Forcing in Computability Theory ........................ 273 13.2 Baire Space, Category and Measure ...................... 278 13.3 n-Genericity and Applications ........................... 287 13.4 Forcing with Trees and Minimal Degrees ................. 299 14 Applications of Determinacy 311 14.1 Gale֊Stewart Games ...................................... 311 14.2 An Upper Cone of Minimal Covers......................... 315 14.3 Borel and Projective Determinacy, and the Global Theory of T 318 15 The Computability of Theories 321 15.1 Feferman’s Theorem....................................... 321 15.2 Truth versus Provability ................................ 323 15.3 Complete Extensions of Peano Arithmetic and n^-Classes . . 324 15.4 The Low Basis Theorem .................................. 329 15.5 Arslanov’s Completeness Criterion........................ 331 15.6 A Priority-Free Solution to Post’s Problem ............. 333 15.7 Randomness .............................................. 335 16 Computability and Structure 343 16.1 Computable Models........................................ 343 16.2 Computability and Mathematical Structures ............... 348 16.3 Effective Ramsey Theory ................................. 362 16.4 Computability in Analysis ............................... 371 16.5 Computability and Incomputability in Science ............ 379 Further Reading 383 Index 389
any_adam_object	1
author	Cooper, Stuart B. 1943-2015
author_GND	(DE-588)133309096
author_facet	Cooper, Stuart B. 1943-2015
author_role	aut
author_sort	Cooper, Stuart B. 1943-2015
author_variant	s b c sb sbc
building	Verbundindex
bvnumber	BV019668177
callnumber-first	Q - Science
callnumber-label	QA9
callnumber-raw	QA9.59.C68 2004
callnumber-search	QA9.59.C68 2004
callnumber-sort	QA 19.59 C68 42004
callnumber-subject	QA - Mathematics
classification_rvk	SK 130 SK 990 ST 134
classification_tum	DAT 542f
ctrlnum	(OCoLC)248800776 (DE-599)BVBBV019668177
dewey-full	511.3 511.322
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	511 - General principles of mathematics
dewey-raw	511.3 511.3 22
dewey-search	511.3 511.3 22
dewey-sort	3511.3
dewey-tens	510 - Mathematics
discipline	Informatik Mathematik
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01735nam a2200457 c 4500</leader><controlfield tag="001">BV019668177</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190329 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">050121s2004 xxud\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1584882379</subfield><subfield code="9">1-58488-237-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)248800776</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019668177</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">XD-US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.59.C68 2004</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3 22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 990</subfield><subfield code="0">(DE-625)143278:</subfield><subfield code="2">rvk</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">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cooper, Stuart B.</subfield><subfield code="d">1943-2015</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)133309096</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability theory</subfield><subfield code="c">S. Barry Cooper</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton [u.a.]</subfield><subfield code="b">Chapman & Hall/CRC</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 409 S.</subfield><subfield code="b">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="0" ind2=" "><subfield code="a">Chapman & Hall/CRC mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbare Funktion</subfield><subfield code="0">(DE-588)4135762-0</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="689" ind1="0" ind2="0"><subfield code="a">Berechenbare Funktion</subfield><subfield code="0">(DE-588)4135762-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</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=012996455&sequence=000001&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-012996455</subfield></datafield></record></collection>
id	DE-604.BV019668177
illustrated	Illustrated
indexdate	2024-07-09T20:02:33Z
institution	BVB
isbn	1584882379
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-012996455
oclc_num	248800776
open_access_boolean
owner	DE-19 DE-BY-UBM DE-91G DE-BY-TUM DE-706 DE-521 DE-634 DE-188 DE-739 DE-11
owner_facet	DE-19 DE-BY-UBM DE-91G DE-BY-TUM DE-706 DE-521 DE-634 DE-188 DE-739 DE-11
physical	IX, 409 S. graph. Darst.
publishDate	2004
publishDateSearch	2004
publishDateSort	2004
publisher	Chapman & Hall/CRC
record_format	marc
series2	Chapman & Hall/CRC mathematics
spelling	Cooper, Stuart B. 1943-2015 Verfasser (DE-588)133309096 aut Computability theory S. Barry Cooper Boca Raton [u.a.] Chapman & Hall/CRC 2004 IX, 409 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Chapman & Hall/CRC mathematics Computable functions Berechenbare Funktion (DE-588)4135762-0 gnd rswk-swf Berechnungstheorie (DE-588)4005581-4 gnd rswk-swf Berechenbare Funktion (DE-588)4135762-0 s Berechnungstheorie (DE-588)4005581-4 s DE-604 Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012996455&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Cooper, Stuart B. 1943-2015 Computability theory Computable functions Berechenbare Funktion (DE-588)4135762-0 gnd Berechnungstheorie (DE-588)4005581-4 gnd
subject_GND	(DE-588)4135762-0 (DE-588)4005581-4
title	Computability theory
title_auth	Computability theory
title_exact_search	Computability theory
title_full	Computability theory S. Barry Cooper
title_fullStr	Computability theory S. Barry Cooper
title_full_unstemmed	Computability theory S. Barry Cooper
title_short	Computability theory
title_sort	computability theory
topic	Computable functions Berechenbare Funktion (DE-588)4135762-0 gnd Berechnungstheorie (DE-588)4005581-4 gnd
topic_facet	Computable functions Berechenbare Funktion Berechnungstheorie
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012996455&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT cooperstuartb computabilitytheory

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Inhaltsverzeichnis

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge