The "almost all" theory of subrecursive degrees is decidable:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Ithaca, New York
1973
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
170 |
| Beschreibung: | 25 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009875220 | ||
| 003 | DE-604 | ||
| 005 | 20111010 | ||
| 007 | t | ||
| 008 | 941103s1973 |||| 00||| undod | ||
| 035 | |a (OCoLC)634375708 | ||
| 035 | |a (DE-599)BVBBV009875220 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91G | ||
| 100 | 1 | |a Mehlhorn, Kurt |d 1949- |e Verfasser |0 (DE-588)139294201 |4 aut | |
| 245 | 1 | 0 | |a The "almost all" theory of subrecursive degrees is decidable |
| 264 | 1 | |a Ithaca, New York |c 1973 | |
| 300 | |a 25 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 170 | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 170 |w (DE-604)BV006185504 |9 170 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006541024 | ||
Datensatz im Suchindex
| _version_ | 1804124235702992896 |
|---|---|
| any_adam_object | |
| author | Mehlhorn, Kurt 1949- |
| author_GND | (DE-588)139294201 |
| author_facet | Mehlhorn, Kurt 1949- |
| author_role | aut |
| author_sort | Mehlhorn, Kurt 1949- |
| author_variant | k m km |
| building | Verbundindex |
| bvnumber | BV009875220 |
| ctrlnum | (OCoLC)634375708 (DE-599)BVBBV009875220 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00908nam a2200265 cb4500</leader><controlfield tag="001">BV009875220</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20111010 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941103s1973 |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634375708</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009875220</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mehlhorn, Kurt</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)139294201</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The "almost all" theory of subrecursive degrees is decidable</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1973</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 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="490" ind1="1" ind2=" "><subfield code="a">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">170</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">170</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">170</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006541024</subfield></datafield></record></collection> |
| id | DE-604.BV009875220 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:42:27Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006541024 |
| oclc_num | 634375708 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 25 S. |
| publishDate | 1973 |
| publishDateSearch | 1973 |
| publishDateSort | 1973 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Mehlhorn, Kurt 1949- Verfasser (DE-588)139294201 aut The "almost all" theory of subrecursive degrees is decidable Ithaca, New York 1973 25 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 170 Department of Computer Science: Technical report Cornell University <Ithaca, NY> 170 (DE-604)BV006185504 170 |
| spellingShingle | Mehlhorn, Kurt 1949- The "almost all" theory of subrecursive degrees is decidable |
| title | The "almost all" theory of subrecursive degrees is decidable |
| title_auth | The "almost all" theory of subrecursive degrees is decidable |
| title_exact_search | The "almost all" theory of subrecursive degrees is decidable |
| title_full | The "almost all" theory of subrecursive degrees is decidable |
| title_fullStr | The "almost all" theory of subrecursive degrees is decidable |
| title_full_unstemmed | The "almost all" theory of subrecursive degrees is decidable |
| title_short | The "almost all" theory of subrecursive degrees is decidable |
| title_sort | the almost all theory of subrecursive degrees is decidable |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT mehlhornkurt thealmostalltheoryofsubrecursivedegreesisdecidable |