Lower bounds by Kolmogorov-complexity:
Using Kolmogorov-complexity, we obtain the following new lower bounds
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, NY
1985
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Dept. of Computer Science: Technical report
666. |
| Schlagworte: | |
| Zusammenfassung: | Using Kolmogorov-complexity, we obtain the following new lower bounds For on-line nondeterministic Turing machines (1) simulating 2 pushdown stores by 1 tape requires |
| Beschreibung: | 26 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV006524719 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 930210s1985 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)16651336 | ||
| 035 | |a (DE-599)BVBBV006524719 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-11 | ||
| 100 | 1 | |a Li, Ming |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Lower bounds by Kolmogorov-complexity |
| 264 | 1 | |a Ithaca, NY |c 1985 | |
| 300 | |a 26 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Dept. of Computer Science: Technical report |v 666. | |
| 520 | 3 | |a Using Kolmogorov-complexity, we obtain the following new lower bounds | |
| 520 | 3 | |a For on-line nondeterministic Turing machines | |
| 520 | 3 | |a (1) simulating 2 pushdown stores by 1 tape requires | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Turing machines | |
| 810 | 2 | |a Dept. of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 666. |w (DE-604)BV006185504 |9 666 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-004154952 | |
Datensatz im Suchindex
| _version_ | 1820882584472649728 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Li, Ming |
| author_facet | Li, Ming |
| author_role | aut |
| author_sort | Li, Ming |
| author_variant | m l ml |
| building | Verbundindex |
| bvnumber | BV006524719 |
| classification_rvk | SS 4570 |
| ctrlnum | (OCoLC)16651336 (DE-599)BVBBV006524719 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV006524719</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">930210s1985 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)16651336</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006524719</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-91G</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Ming</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Lower bounds by Kolmogorov-complexity</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, NY</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">26 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> / Dept. of Computer Science: Technical report</subfield><subfield code="v">666.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Using Kolmogorov-complexity, we obtain the following new lower bounds</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">For on-line nondeterministic Turing machines</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">(1) simulating 2 pushdown stores by 1 tape requires</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turing machines</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Dept. of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">666.</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">666</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004154952</subfield></datafield></record></collection> |
| id | DE-604.BV006524719 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T17:09:13Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004154952 |
| oclc_num | 16651336 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-11 |
| owner_facet | DE-91G DE-BY-TUM DE-11 |
| physical | 26 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Dept. of Computer Science: Technical report |
| spelling | Li, Ming Verfasser aut Lower bounds by Kolmogorov-complexity Ithaca, NY 1985 26 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Dept. of Computer Science: Technical report 666. Using Kolmogorov-complexity, we obtain the following new lower bounds For on-line nondeterministic Turing machines (1) simulating 2 pushdown stores by 1 tape requires Computational complexity Turing machines Dept. of Computer Science: Technical report Cornell University <Ithaca, NY> 666. (DE-604)BV006185504 666 |
| spellingShingle | Li, Ming Lower bounds by Kolmogorov-complexity Computational complexity Turing machines |
| title | Lower bounds by Kolmogorov-complexity |
| title_auth | Lower bounds by Kolmogorov-complexity |
| title_exact_search | Lower bounds by Kolmogorov-complexity |
| title_full | Lower bounds by Kolmogorov-complexity |
| title_fullStr | Lower bounds by Kolmogorov-complexity |
| title_full_unstemmed | Lower bounds by Kolmogorov-complexity |
| title_short | Lower bounds by Kolmogorov-complexity |
| title_sort | lower bounds by kolmogorov complexity |
| topic | Computational complexity Turing machines |
| topic_facet | Computational complexity Turing machines |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT liming lowerboundsbykolmogorovcomplexity |