Theory of recursive functions and effective computability

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Rogers, Hartley (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Cambridge, Mass. u.a. MIT Pr. 1987
Ausgabe:1. MIT Pr. paperback ed.
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000 c 4500
001 BV000690404
003 DE-604
005 00000000000000.0
007 t
008 880120s1987 |||| 00||| eng d
020 |a 0262680521  |9 0-262-68052-1 
035 |a (OCoLC)15108070 
035 |a (DE-599)BVBBV000690404 
040 |a DE-604  |b ger  |e rakddb 
041 0 |a eng 
049 |a DE-12  |a DE-91G  |a DE-706 
050 0 |a QA9.615 
082 0 |a 511.3  |2 19 
084 |a SK 130  |0 (DE-625)143216:  |2 rvk 
084 |a DAT 542f  |2 stub 
100 1 |a Rogers, Hartley  |e Verfasser  |4 aut 
245 1 0 |a Theory of recursive functions and effective computability 
250 |a 1. MIT Pr. paperback ed. 
264 1 |a Cambridge, Mass. u.a.  |b MIT Pr.  |c 1987 
300 |a XIX, 482 S. 
336 |b txt  |2 rdacontent 
337 |b n  |2 rdamedia 
338 |b nc  |2 rdacarrier 
650 4 |a Fonctions calculables 
650 7 |a Fonctions calculables  |2 ram 
650 4 |a Fonctions récursives 
650 7 |a Fonctions récursives  |2 ram 
650 7 |a Recursieve functies  |2 gtt 
650 4 |a Computable functions 
650 4 |a Recursive functions 
650 0 7 |a Rekursive Funktion  |0 (DE-588)4138367-9  |2 gnd  |9 rswk-swf 
650 0 7 |a Theorie  |0 (DE-588)4059787-8  |2 gnd  |9 rswk-swf 
650 0 7 |a Berechenbarkeit  |0 (DE-588)4138368-0  |2 gnd  |9 rswk-swf 
689 0 0 |a Rekursive Funktion  |0 (DE-588)4138367-9  |D s 
689 0 1 |a Theorie  |0 (DE-588)4059787-8  |D s 
689 0 |8 1\p  |5 DE-604 
689 1 0 |a Berechenbarkeit  |0 (DE-588)4138368-0  |D s 
689 1 |8 2\p  |5 DE-604 
999 |a oai:aleph.bib-bvb.de:BVB01-000430647 
883 1 |8 1\p  |a cgwrk  |d 20201028  |q DE-101  |u https://d-nb.info/provenance/plan#cgwrk 
883 1 |8 2\p  |a cgwrk  |d 20201028  |q DE-101  |u https://d-nb.info/provenance/plan#cgwrk 

Datensatz im Suchindex

DE-BY-TUM_call_number 0102/DAT 542f 2001 A 29643(2)
DE-BY-TUM_katkey 81331
DE-BY-TUM_media_number 040010385434
_version_ 1816711285790736384
any_adam_object
author Rogers, Hartley
author_facet Rogers, Hartley
author_role aut
author_sort Rogers, Hartley
author_variant h r hr
building Verbundindex
bvnumber BV000690404
callnumber-first Q - Science
callnumber-label QA9
callnumber-raw QA9.615
callnumber-search QA9.615
callnumber-sort QA 19.615
callnumber-subject QA - Mathematics
classification_rvk SK 130
classification_tum DAT 542f
ctrlnum (OCoLC)15108070
(DE-599)BVBBV000690404
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 Informatik
Mathematik
edition 1. MIT Pr. paperback ed.
format Book
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01740nam a2200517 c 4500</leader><controlfield tag="001">BV000690404</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880120s1987 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262680521</subfield><subfield code="9">0-262-68052-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)15108070</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV000690404</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="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.615</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">19</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">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rogers, Hartley</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Theory of recursive functions and effective computability</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. MIT Pr. paperback ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass. u.a.</subfield><subfield code="b">MIT Pr.</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIX, 482 S.</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">Fonctions calculables</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fonctions calculables</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fonctions récursives</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fonctions récursives</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Recursieve functies</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive functions</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rekursive Funktion</subfield><subfield code="0">(DE-588)4138367-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theorie</subfield><subfield code="0">(DE-588)4059787-8</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="689" ind1="0" ind2="0"><subfield code="a">Rekursive Funktion</subfield><subfield code="0">(DE-588)4138367-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Theorie</subfield><subfield code="0">(DE-588)4059787-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-000430647</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="883" ind1="1" ind2=" "><subfield code="8">2\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></record></collection>
id DE-604.BV000690404
illustrated Not Illustrated
indexdate 2024-11-25T17:07:22Z
institution BVB
isbn 0262680521
language English
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-000430647
oclc_num 15108070
open_access_boolean
owner DE-12
DE-91G
DE-BY-TUM
DE-706
owner_facet DE-12
DE-91G
DE-BY-TUM
DE-706
physical XIX, 482 S.
publishDate 1987
publishDateSearch 1987
publishDateSort 1987
publisher MIT Pr.
record_format marc
spellingShingle Rogers, Hartley
Theory of recursive functions and effective computability
Fonctions calculables
Fonctions calculables ram
Fonctions récursives
Fonctions récursives ram
Recursieve functies gtt
Computable functions
Recursive functions
Rekursive Funktion (DE-588)4138367-9 gnd
Theorie (DE-588)4059787-8 gnd
Berechenbarkeit (DE-588)4138368-0 gnd
subject_GND (DE-588)4138367-9
(DE-588)4059787-8
(DE-588)4138368-0
title Theory of recursive functions and effective computability
title_auth Theory of recursive functions and effective computability
title_exact_search Theory of recursive functions and effective computability
title_full Theory of recursive functions and effective computability
title_fullStr Theory of recursive functions and effective computability
title_full_unstemmed Theory of recursive functions and effective computability
title_short Theory of recursive functions and effective computability
title_sort theory of recursive functions and effective computability
topic Fonctions calculables
Fonctions calculables ram
Fonctions récursives
Fonctions récursives ram
Recursieve functies gtt
Computable functions
Recursive functions
Rekursive Funktion (DE-588)4138367-9 gnd
Theorie (DE-588)4059787-8 gnd
Berechenbarkeit (DE-588)4138368-0 gnd
topic_facet Fonctions calculables
Fonctions récursives
Recursieve functies
Computable functions
Recursive functions
Rekursive Funktion
Theorie
Berechenbarkeit
work_keys_str_mv AT rogershartley theoryofrecursivefunctionsandeffectivecomputability