Complexity measures for programming languages:
A theory of complexity is developed for algorithms implemented in typical programming languages. The complexity of a program may be interpreted in many ways; a method for measuring a specific type of complexity is a complexity measure -- some function of the amount of a particular resource used by a...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge, Mass.
Mass Inst. of Technology, Project MAC
1971
|
| Series: | MAC technical memorandum
17 |
| Subjects: | |
| Summary: | A theory of complexity is developed for algorithms implemented in typical programming languages. The complexity of a program may be interpreted in many ways; a method for measuring a specific type of complexity is a complexity measure -- some function of the amount of a particular resource used by a program in processing an input. After the complexity of the basic program elements is determined, program complexity is analyzed with respect to single inputs and then with respect to finite sets of legitimate halting inputs. A program equation is developed to aid in the complexity analysis. Using this equation, an input set is partitioned into classes of constant complexity. Several equivalence relations are defined, relating different programs by their complexity. Complexity is also discussed in terms of concatenation and functional equivalence of program. (Author). |
| Item Description: | Kopie, erschienen bei National Techn. Information Service, Springfield, Va. |
| Physical Description: | 85 S. |
Staff View
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV022136216 | ||
| 003 | DE-604 | ||
| 005 | 20190208 | ||
| 007 | t | ||
| 008 | 890123s1971 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227638624 | ||
| 035 | |a (DE-599)BVBBV022136216 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MAC-TM-17 | ||
| 100 | 1 | |a Goodman, Leonard I. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Complexity measures for programming languages |
| 264 | 1 | |a Cambridge, Mass. |b Mass Inst. of Technology, Project MAC |c 1971 | |
| 300 | |a 85 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a MAC technical memorandum |v 17 | |
| 500 | |a Kopie, erschienen bei National Techn. Information Service, Springfield, Va. | ||
| 520 | 3 | |a A theory of complexity is developed for algorithms implemented in typical programming languages. The complexity of a program may be interpreted in many ways; a method for measuring a specific type of complexity is a complexity measure -- some function of the amount of a particular resource used by a program in processing an input. After the complexity of the basic program elements is determined, program complexity is analyzed with respect to single inputs and then with respect to finite sets of legitimate halting inputs. A program equation is developed to aid in the complexity analysis. Using this equation, an input set is partitioned into classes of constant complexity. Several equivalence relations are defined, relating different programs by their complexity. Complexity is also discussed in terms of concatenation and functional equivalence of program. (Author). | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Computer Programming and Software |2 scgdst | |
| 650 | 7 | |a Computer programming |2 dtict | |
| 650 | 7 | |a Computer programs |2 dtict | |
| 650 | 7 | |a Efficiency |2 dtict | |
| 650 | 7 | |a Mathematical models |2 dtict | |
| 650 | 7 | |a Programming languages |2 dtict | |
| 650 | 4 | |a Mathematisches Modell | |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmiersprache |0 (DE-588)4047409-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Programmiersprache |0 (DE-588)4047409-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 830 | 0 | |a MAC technical memorandum |v 17 |w (DE-604)BV008910218 |9 17 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015350834 | ||
Record in the Search Index
| _version_ | 1804136108538200064 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Goodman, Leonard I. |
| author_facet | Goodman, Leonard I. |
| author_role | aut |
| author_sort | Goodman, Leonard I. |
| author_variant | l i g li lig |
| building | Verbundindex |
| bvnumber | BV022136216 |
| ctrlnum | (OCoLC)227638624 (DE-599)BVBBV022136216 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02414nam a2200469zcb4500</leader><controlfield tag="001">BV022136216</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190208 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890123s1971 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227638624</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022136216</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MAC-TM-17</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goodman, Leonard I.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity measures for programming languages</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass Inst. of Technology, Project MAC</subfield><subfield code="c">1971</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">85 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">MAC technical memorandum</subfield><subfield code="v">17</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Kopie, erschienen bei National Techn. Information Service, Springfield, Va.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">A theory of complexity is developed for algorithms implemented in typical programming languages. The complexity of a program may be interpreted in many ways; a method for measuring a specific type of complexity is a complexity measure -- some function of the amount of a particular resource used by a program in processing an input. After the complexity of the basic program elements is determined, program complexity is analyzed with respect to single inputs and then with respect to finite sets of legitimate halting inputs. A program equation is developed to aid in the complexity analysis. Using this equation, an input set is partitioned into classes of constant complexity. Several equivalence relations are defined, relating different programs by their complexity. Complexity is also discussed in terms of concatenation and functional equivalence of program. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Programming and Software</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer programming</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer programs</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Efficiency</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematical models</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programming languages</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematisches Modell</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">MAC technical memorandum</subfield><subfield code="v">17</subfield><subfield code="w">(DE-604)BV008910218</subfield><subfield code="9">17</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015350834</subfield></datafield></record></collection> |
| id | DE-604.BV022136216 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:17:20Z |
| indexdate | 2024-07-09T20:51:09Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015350834 |
| oclc_num | 227638624 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 85 S. |
| publishDate | 1971 |
| publishDateSearch | 1971 |
| publishDateSort | 1971 |
| publisher | Mass Inst. of Technology, Project MAC |
| record_format | marc |
| series | MAC technical memorandum |
| series2 | MAC technical memorandum |
| spelling | Goodman, Leonard I. Verfasser aut Complexity measures for programming languages Cambridge, Mass. Mass Inst. of Technology, Project MAC 1971 85 S. txt rdacontent n rdamedia nc rdacarrier MAC technical memorandum 17 Kopie, erschienen bei National Techn. Information Service, Springfield, Va. A theory of complexity is developed for algorithms implemented in typical programming languages. The complexity of a program may be interpreted in many ways; a method for measuring a specific type of complexity is a complexity measure -- some function of the amount of a particular resource used by a program in processing an input. After the complexity of the basic program elements is determined, program complexity is analyzed with respect to single inputs and then with respect to finite sets of legitimate halting inputs. A program equation is developed to aid in the complexity analysis. Using this equation, an input set is partitioned into classes of constant complexity. Several equivalence relations are defined, relating different programs by their complexity. Complexity is also discussed in terms of concatenation and functional equivalence of program. (Author). Algorithms dtict Computer Programming and Software scgdst Computer programming dtict Computer programs dtict Efficiency dtict Mathematical models dtict Programming languages dtict Mathematisches Modell Komplexität (DE-588)4135369-9 gnd rswk-swf Programmiersprache (DE-588)4047409-4 gnd rswk-swf Programmiersprache (DE-588)4047409-4 s DE-604 Komplexität (DE-588)4135369-9 s MAC technical memorandum 17 (DE-604)BV008910218 17 |
| spellingShingle | Goodman, Leonard I. Complexity measures for programming languages MAC technical memorandum Algorithms dtict Computer Programming and Software scgdst Computer programming dtict Computer programs dtict Efficiency dtict Mathematical models dtict Programming languages dtict Mathematisches Modell Komplexität (DE-588)4135369-9 gnd Programmiersprache (DE-588)4047409-4 gnd |
| subject_GND | (DE-588)4135369-9 (DE-588)4047409-4 |
| title | Complexity measures for programming languages |
| title_auth | Complexity measures for programming languages |
| title_exact_search | Complexity measures for programming languages |
| title_exact_search_txtP | Complexity measures for programming languages |
| title_full | Complexity measures for programming languages |
| title_fullStr | Complexity measures for programming languages |
| title_full_unstemmed | Complexity measures for programming languages |
| title_short | Complexity measures for programming languages |
| title_sort | complexity measures for programming languages |
| topic | Algorithms dtict Computer Programming and Software scgdst Computer programming dtict Computer programs dtict Efficiency dtict Mathematical models dtict Programming languages dtict Mathematisches Modell Komplexität (DE-588)4135369-9 gnd Programmiersprache (DE-588)4047409-4 gnd |
| topic_facet | Algorithms Computer Programming and Software Computer programming Computer programs Efficiency Mathematical models Programming languages Mathematisches Modell Komplexität Programmiersprache |
| volume_link | (DE-604)BV008910218 |
| work_keys_str_mv | AT goodmanleonardi complexitymeasuresforprogramminglanguages |