| 查看: 159 | 回复: 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 ] |
» 猜你喜欢
E0414, 我的本子有没有希望?
已经有9人回复
青A35岁以下通知答辩了吗
已经有3人回复
【全奖博士/科研助理/博后招生】新加坡南洋理工大学机械与航空航天学院
已经有4人回复
希望面上有个好结果
已经有7人回复
三区计算机方向期刊推荐
已经有5人回复
sci论文二审求助
已经有5人回复











回复此楼