Kính lúp
Trình tải tìm kiếm

Mark Burgin 
Super-Recursive Algorithms 

Ủng hộ

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.

€96.29
phương thức thanh toán

Mục lục

Recursive Algorithms.- Subrecursive Algorithms.- Superrecursive Algorithms: Problems of Computability.- Superrecursive Algorithms: Problems of Efficiency.- Conclusion: Problems of Information Technology and Computer Science Development.

Giới thiệu về tác giả

 Burgin published extensively on this new theoretical topic. Based on UCLA lectures, articles, invited ACM Communications Survey article (11/01), and invited High Performance Computing Symposium presentation.
Ngôn ngữ Anh ● định dạng PDF ● Trang 304 ● ISBN 9780387268064 ● Kích thước tập tin 2.5 MB ● Nhà xuất bản Springer New York ● Thành phố NY ● Quốc gia US ● Được phát hành 2006 ● Có thể tải xuống 24 tháng ● Tiền tệ EUR ● TÔI 2144287 ● Sao chép bảo vệ DRM xã hội

Thêm sách điện tử từ cùng một tác giả / Biên tập viên

3.895 Ebooks trong thể loại này