Computability and Models: Perspectives East and West
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Boston, MA
Springer US
2003
|
Schriftenreihe: | The University Series in Mathematics
|
Schlagworte: | |
Online-Zugang: | Volltext |
Beschreibung: | Science involves descriptions of the world we live in. It also depends on nature exhibiting what we can best describe as a high aLgorithmic content. The theme running through this collection of papers is that of the interaction between descriptions, in the form of formal theories, and the algorithmic content of what is described, namely of the modeLs of those theories. This appears most explicitly here in a number of valuable, and substantial, contributions to what has until recently been known as 'recursive model theory' - an area in which researchers from the former Soviet Union (in particular Novosibirsk) have been pre-eminent. There are also articles concerned with the computability of aspects of familiar mathematical structures, and - a return to the sort of basic underlying questions considered by Alan Turing in the early days of the subject - an article giving a new perspective on computability in the real world. And, of course, there are also articles concerned with the classical theory of computability, including the first widely available survey of work on quasi-reducibility. The contributors, all internationally recognised experts in their fields, have been associated with the three-year INTAS-RFBR Research Project "Com putability and Models" (Project No. 972-139), and most have participated in one or more of the various international workshops (in Novosibirsk, Heidelberg and Almaty) and otherresearch activities of the network |
Beschreibung: | 1 Online-Ressource (XIX, 375 p) |
ISBN: | 9781461507550 9781461352259 |
DOI: | 10.1007/978-1-4615-0755-0 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV042420853 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 150317s2003 |||| o||u| ||||||eng d | ||
020 | |a 9781461507550 |c Online |9 978-1-4615-0755-0 | ||
020 | |a 9781461352259 |c Print |9 978-1-4613-5225-9 | ||
024 | 7 | |a 10.1007/978-1-4615-0755-0 |2 doi | |
035 | |a (OCoLC)905466283 | ||
035 | |a (DE-599)BVBBV042420853 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
082 | 0 | |a 511.3 |2 23 | |
084 | |a MAT 000 |2 stub | ||
100 | 1 | |a Cooper, S. Barry |e Verfasser |4 aut | |
245 | 1 | 0 | |a Computability and Models |b Perspectives East and West |c by S. Barry Cooper, Sergey S. Goncharov |
264 | 1 | |a Boston, MA |b Springer US |c 2003 | |
300 | |a 1 Online-Ressource (XIX, 375 p) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a The University Series in Mathematics | |
500 | |a Science involves descriptions of the world we live in. It also depends on nature exhibiting what we can best describe as a high aLgorithmic content. The theme running through this collection of papers is that of the interaction between descriptions, in the form of formal theories, and the algorithmic content of what is described, namely of the modeLs of those theories. This appears most explicitly here in a number of valuable, and substantial, contributions to what has until recently been known as 'recursive model theory' - an area in which researchers from the former Soviet Union (in particular Novosibirsk) have been pre-eminent. There are also articles concerned with the computability of aspects of familiar mathematical structures, and - a return to the sort of basic underlying questions considered by Alan Turing in the early days of the subject - an article giving a new perspective on computability in the real world. And, of course, there are also articles concerned with the classical theory of computability, including the first widely available survey of work on quasi-reducibility. The contributors, all internationally recognised experts in their fields, have been associated with the three-year INTAS-RFBR Research Project "Com putability and Models" (Project No. 972-139), and most have participated in one or more of the various international workshops (in Novosibirsk, Heidelberg and Almaty) and otherresearch activities of the network | ||
650 | 4 | |a Mathematics | |
650 | 4 | |a Information theory | |
650 | 4 | |a Computer science | |
650 | 4 | |a Computational complexity | |
650 | 4 | |a Logic, Symbolic and mathematical | |
650 | 4 | |a Mathematical Logic and Foundations | |
650 | 4 | |a Theory of Computation | |
650 | 4 | |a Philosophy | |
650 | 4 | |a Mathematics of Computing | |
650 | 4 | |a Discrete Mathematics in Computer Science | |
650 | 4 | |a Informatik | |
650 | 4 | |a Mathematik | |
650 | 4 | |a Philosophie | |
700 | 1 | |a Goncharov, Sergey S. |e Sonstige |4 oth | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4615-0755-0 |x Verlag |3 Volltext |
912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
940 | 1 | |q ZDB-2-SMA_Archive | |
999 | |a oai:aleph.bib-bvb.de:BVB01-027856270 |
Datensatz im Suchindex
_version_ | 1804153093276827648 |
---|---|
any_adam_object | |
author | Cooper, S. Barry |
author_facet | Cooper, S. Barry |
author_role | aut |
author_sort | Cooper, S. Barry |
author_variant | s b c sb sbc |
building | Verbundindex |
bvnumber | BV042420853 |
classification_tum | MAT 000 |
collection | ZDB-2-SMA ZDB-2-BAE |
ctrlnum | (OCoLC)905466283 (DE-599)BVBBV042420853 |
dewey-full | 511.3 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.3 |
dewey-search | 511.3 |
dewey-sort | 3511.3 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
doi_str_mv | 10.1007/978-1-4615-0755-0 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03177nmm a2200529zc 4500</leader><controlfield tag="001">BV042420853</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2003 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461507550</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4615-0755-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461352259</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4613-5225-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4615-0755-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)905466283</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042420853</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cooper, S. Barry</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability and Models</subfield><subfield code="b">Perspectives East and West</subfield><subfield code="c">by S. Barry Cooper, Sergey S. Goncharov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIX, 375 p)</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">The University Series in Mathematics</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Science involves descriptions of the world we live in. It also depends on nature exhibiting what we can best describe as a high aLgorithmic content. The theme running through this collection of papers is that of the interaction between descriptions, in the form of formal theories, and the algorithmic content of what is described, namely of the modeLs of those theories. This appears most explicitly here in a number of valuable, and substantial, contributions to what has until recently been known as 'recursive model theory' - an area in which researchers from the former Soviet Union (in particular Novosibirsk) have been pre-eminent. There are also articles concerned with the computability of aspects of familiar mathematical structures, and - a return to the sort of basic underlying questions considered by Alan Turing in the early days of the subject - an article giving a new perspective on computability in the real world. And, of course, there are also articles concerned with the classical theory of computability, including the first widely available survey of work on quasi-reducibility. The contributors, all internationally recognised experts in their fields, have been associated with the three-year INTAS-RFBR Research Project "Com putability and Models" (Project No. 972-139), and most have participated in one or more of the various international workshops (in Novosibirsk, Heidelberg and Almaty) and otherresearch activities of the network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Foundations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Philosophy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics of Computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Philosophie</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goncharov, Sergey S.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4615-0755-0</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027856270</subfield></datafield></record></collection> |
id | DE-604.BV042420853 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T01:21:07Z |
institution | BVB |
isbn | 9781461507550 9781461352259 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027856270 |
oclc_num | 905466283 |
open_access_boolean | |
owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
physical | 1 Online-Ressource (XIX, 375 p) |
psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
publishDate | 2003 |
publishDateSearch | 2003 |
publishDateSort | 2003 |
publisher | Springer US |
record_format | marc |
series2 | The University Series in Mathematics |
spelling | Cooper, S. Barry Verfasser aut Computability and Models Perspectives East and West by S. Barry Cooper, Sergey S. Goncharov Boston, MA Springer US 2003 1 Online-Ressource (XIX, 375 p) txt rdacontent c rdamedia cr rdacarrier The University Series in Mathematics Science involves descriptions of the world we live in. It also depends on nature exhibiting what we can best describe as a high aLgorithmic content. The theme running through this collection of papers is that of the interaction between descriptions, in the form of formal theories, and the algorithmic content of what is described, namely of the modeLs of those theories. This appears most explicitly here in a number of valuable, and substantial, contributions to what has until recently been known as 'recursive model theory' - an area in which researchers from the former Soviet Union (in particular Novosibirsk) have been pre-eminent. There are also articles concerned with the computability of aspects of familiar mathematical structures, and - a return to the sort of basic underlying questions considered by Alan Turing in the early days of the subject - an article giving a new perspective on computability in the real world. And, of course, there are also articles concerned with the classical theory of computability, including the first widely available survey of work on quasi-reducibility. The contributors, all internationally recognised experts in their fields, have been associated with the three-year INTAS-RFBR Research Project "Com putability and Models" (Project No. 972-139), and most have participated in one or more of the various international workshops (in Novosibirsk, Heidelberg and Almaty) and otherresearch activities of the network Mathematics Information theory Computer science Computational complexity Logic, Symbolic and mathematical Mathematical Logic and Foundations Theory of Computation Philosophy Mathematics of Computing Discrete Mathematics in Computer Science Informatik Mathematik Philosophie Goncharov, Sergey S. Sonstige oth https://doi.org/10.1007/978-1-4615-0755-0 Verlag Volltext |
spellingShingle | Cooper, S. Barry Computability and Models Perspectives East and West Mathematics Information theory Computer science Computational complexity Logic, Symbolic and mathematical Mathematical Logic and Foundations Theory of Computation Philosophy Mathematics of Computing Discrete Mathematics in Computer Science Informatik Mathematik Philosophie |
title | Computability and Models Perspectives East and West |
title_auth | Computability and Models Perspectives East and West |
title_exact_search | Computability and Models Perspectives East and West |
title_full | Computability and Models Perspectives East and West by S. Barry Cooper, Sergey S. Goncharov |
title_fullStr | Computability and Models Perspectives East and West by S. Barry Cooper, Sergey S. Goncharov |
title_full_unstemmed | Computability and Models Perspectives East and West by S. Barry Cooper, Sergey S. Goncharov |
title_short | Computability and Models |
title_sort | computability and models perspectives east and west |
title_sub | Perspectives East and West |
topic | Mathematics Information theory Computer science Computational complexity Logic, Symbolic and mathematical Mathematical Logic and Foundations Theory of Computation Philosophy Mathematics of Computing Discrete Mathematics in Computer Science Informatik Mathematik Philosophie |
topic_facet | Mathematics Information theory Computer science Computational complexity Logic, Symbolic and mathematical Mathematical Logic and Foundations Theory of Computation Philosophy Mathematics of Computing Discrete Mathematics in Computer Science Informatik Mathematik Philosophie |
url | https://doi.org/10.1007/978-1-4615-0755-0 |
work_keys_str_mv | AT coopersbarry computabilityandmodelsperspectiveseastandwest AT goncharovsergeys computabilityandmodelsperspectiveseastandwest |