عدسة مكبرة
بحث محمل

Mark Burgin 
Super-Recursive Algorithms 

الدعم

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
طرق الدفع

قائمة المحتويات

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

عن المؤلف

 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.
لغة الإنجليزية ● شكل PDF ● صفحات 304 ● ISBN 9780387268064 ● حجم الملف 2.5 MB ● الناشر Springer New York ● مدينة NY ● بلد US ● نشرت 2006 ● للتحميل 24 الشهور ● دقة EUR ● هوية شخصية 2144287 ● حماية النسخ DRM الاجتماعية

المزيد من الكتب الإلكترونية من نفس المؤلف (المؤلفين) / محرر

3٬895 كتب إلكترونية في هذه الفئة