| 查看: 134 | 回复: 0 | ||
| 当前主题已经存档。 | ||
[资源]
Super-Recursive Algorithms (Monographs in Computer Science)
|
||
|
Super-Recursive Algorithms (Monographs in Computer Science) * Publisher: Springer * Number Of Pages: 306 * Publication Date: 2004-12-01 * Sales Rank: 1272289 * ISBN / ASIN: 0387955690 * EAN: 9780387955698 * Binding: Hardcover * Manufacturer: Springer * Studio: Springer * Average Rating: * Total Reviews: Book Description: ) Super-Recursive Algorithms provides an accessible, focused examination of the theory of super-recursive algorithms and its ramifications for the computer industry, networks, artificial intelligence, embedded systems, and the Internet. The book demonstrates how these algorithms are more appropriate as mathematical models for modern computers, and how these algorithms present a better framework for computing methods in such areas as numerical analysis, array searching, and controlling and monitoring systems. In addition, a new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole, is developed. Problems of efficiency, software development, parallel and distributed processing, pervasive and emerging computation, computer architecture, machine learning, brain modeling, knowledge discovery, and intelligent systems are addressed. This clear exposition, motivated by numerous examples and illustrations, serves researchers and advanced students interested in theory of computation and algorithms. [ Last edited by cuplgz on 2007-5-3 at 14:10 ] |
回复此楼» 猜你喜欢
遇见不省心的家人很难过
已经有19人回复
-
退学或坚持读
已经有25人回复
-
博士延得我，科研能力直往上蹿
已经有4人回复
-
免疫学博士有名额，速联系
已经有14人回复
-
面上基金申报没有其他的参与者成吗
已经有4人回复
-
多组分精馏求助
已经有6人回复