| 書目名稱 | Models of Computation |
| 副標題 | An Introduction to C |
| 編輯 | Maribel Fernández |
| 視頻video | http://file.papertrans.cn/637/636800/636800.mp4 |
| 概述 | Provides an in-depth analysis of the basic concepts underlying the models of computation that underpin the most well-known families of programming languages |
| 叢書名稱 | Undergraduate Topics in Computer Science |
| 圖書封面 |  |
| 描述 | .A Concise Introduction to Computation Models and Computability Theory provides an introduction to the essential concepts in computability, using several models of computation, from the standard Turing Machines and Recursive Functions, to the modern computation models inspired by quantum physics. An in-depth analysis of the basic concepts underlying each model of computation is provided....Divided into two parts, the first highlights the traditional computation models used in the first studies on computability: - Automata and Turing Machines; - Recursive functions and the Lambda-Calculus; - Logic-based computation models....and the second part covers object-oriented and interaction-based models. There is also a chapter on concurrency, and a final chapter on emergent computation models inspired by quantum mechanics....At the end of each chapter there is a discussion on the use of computation models in the design of programming languages.. |
| 出版日期 | Textbook 2009 |
| 關(guān)鍵詞 | Action; Turing; automata; computability theory; design; programming; programming language |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-84882-434-8 |
| isbn_softcover | 978-1-84882-433-1 |
| isbn_ebook | 978-1-84882-434-8Series ISSN 1863-7310 Series E-ISSN 2197-1781 |
| issn_series | 1863-7310 |
| copyright | Springer-Verlag London 2009 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-11 22:07
發(fā)表于 2025-3-21 16:37:30
