Cargando…
Computability, complexity, and languages: fundamentals of theoretical computer science
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. <br><br>This text is composed of five p...
| Autores principales: | , , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Academic Press
1983
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/2124174 |
| _version_ | 1780949555905298432 |
|---|---|
| author | Davis, Martin D Weyuker, Elaine J Rheinboldt, Werner |
| author_facet | Davis, Martin D Weyuker, Elaine J Rheinboldt, Werner |
| author_sort | Davis, Martin D |
| collection | CERN |
| description | Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. <br><br>This text is composed of five parts encompassing 17 chapters, and begins with an introduction to the use of proofs in mathematics and the development of computability theory in the context of an extremely simple abstract programming language. The succeeding parts demonstrate the performance of abstract programming language using a macro expa |
| id | cern-2124174 |
| institution | Organización Europea para la Investigación Nuclear |
| language | eng |
| publishDate | 1983 |
| publisher | Academic Press |
| record_format | invenio |
| spelling | cern-21241742021-04-21T19:50:43Zhttp://cds.cern.ch/record/2124174engDavis, Martin DWeyuker, Elaine JRheinboldt, WernerComputability, complexity, and languages: fundamentals of theoretical computer scienceMathematical Physics and MathematicsComputability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. <br><br>This text is composed of five parts encompassing 17 chapters, and begins with an introduction to the use of proofs in mathematics and the development of computability theory in the context of an extremely simple abstract programming language. The succeeding parts demonstrate the performance of abstract programming language using a macro expaAcademic Pressoai:cds.cern.ch:21241741983 |
| spellingShingle | Mathematical Physics and Mathematics Davis, Martin D Weyuker, Elaine J Rheinboldt, Werner Computability, complexity, and languages: fundamentals of theoretical computer science |
| title | Computability, complexity, and languages: fundamentals of theoretical computer science |
| title_full | Computability, complexity, and languages: fundamentals of theoretical computer science |
| title_fullStr | Computability, complexity, and languages: fundamentals of theoretical computer science |
| title_full_unstemmed | Computability, complexity, and languages: fundamentals of theoretical computer science |
| title_short | Computability, complexity, and languages: fundamentals of theoretical computer science |
| title_sort | computability, complexity, and languages: fundamentals of theoretical computer science |
| topic | Mathematical Physics and Mathematics |
| url | http://cds.cern.ch/record/2124174 |
| work_keys_str_mv | AT davismartind computabilitycomplexityandlanguagesfundamentalsoftheoreticalcomputerscience AT weyukerelainej computabilitycomplexityandlanguagesfundamentalsoftheoreticalcomputerscience AT rheinboldtwerner computabilitycomplexityandlanguagesfundamentalsoftheoreticalcomputerscience |