| 000 -LEADER |
|---|
| fixed length control field |
04231nam a22005055i 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
978-0-387-26806-4 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20161121230516.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
100301s2005 xxu| s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780387268064 |
| -- |
978-0-387-26806-4 |
| 024 7# - OTHER STANDARD IDENTIFIER |
|---|
| Standard number or code |
10.1007/b138114 |
| Source of number or code |
doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
TA342-343 |
| 072 #7 - SUBJECT CATEGORY CODE |
|---|
| Subject category code |
PBWH |
| Source |
bicssc |
| 072 #7 - SUBJECT CATEGORY CODE |
|---|
| Subject category code |
TBJ |
| Source |
bicssc |
| 072 #7 - SUBJECT CATEGORY CODE |
|---|
| Subject category code |
MAT003000 |
| Source |
bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE |
|---|
| Subject category code |
TEC009060 |
| Source |
bisacsh |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
003.3 |
| Edition number |
23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Burgin, Mark. |
| Relator term |
author. |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Super-Recursive Algorithms |
| Medium |
[electronic resource] / |
| Statement of responsibility, etc. |
by Mark Burgin. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Place of production, publication, distribution, manufacture |
New York, NY : |
| Name of producer, publisher, distributor, manufacturer |
Springer New York, |
| Date of production, publication, distribution, manufacture, or copyright notice |
2005. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XII, 304 p. |
| Other physical details |
online resource. |
| 336 ## - CONTENT TYPE |
|---|
| Content type term |
text |
| Content type code |
txt |
| Source |
rdacontent |
| 337 ## - MEDIA TYPE |
|---|
| Media type term |
computer |
| Media type code |
c |
| Source |
rdamedia |
| 338 ## - CARRIER TYPE |
|---|
| Carrier type term |
online resource |
| Carrier type code |
cr |
| Source |
rdacarrier |
| 347 ## - DIGITAL FILE CHARACTERISTICS |
|---|
| File type |
text file |
| Encoding format |
PDF |
| Source |
rda |
| 490 1# - SERIES STATEMENT |
|---|
| Series statement |
Monographs in Computer Science, |
| International Standard Serial Number |
0172-603X |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Recursive Algorithms -- Subrecursive Algorithms -- Superrecursive Algorithms: Problems of Computability -- Superrecursive Algorithms: Problems of Efficiency -- Conclusion: Problems of Information Technology and Computer Science Development. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
New discoveries about algorithms are leading scientists beyond the Church-Turing Thesis, which governs the "algorithmic universe" and asserts the conventionality of recursive algorithms. A new paradigm for computation, the super-recursive algorithm, offers promising prospects for algorithms of much greater computing power and efficiency. 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. Topics and Features: * Encompasses and systematizes all main classes of super-recursive algorithms and the theory behind them * Describes the strengthening link between the theory of super-recursive algorithms and actual algorithms close to practical realization * Examines the theory's basis as a foundation for advancements in computing, information science, and related technologies * Encompasses and systematizes all main types of mathematical models of algorithms * Highlights how super-recursive algorithms pave the way for more advanced design, utilization, and maintenance of computers * Examines and restructures the existing variety of mathematical models of complexity of algorithms and computation, introducing new models * Possesses a comprehensive bibliography and index This clear exposition, motivated by numerous examples and illustrations, serves to develop a new paradigm for complex, high-performance computing based on both partial recursive functions and more inclusive recursive algorithms. Researchers and advanced students interested in theory of computation and algorithms will find the book an essential resource for an important new class of algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Mathematics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computers. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Mathematical models. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Mathematics. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Mathematical Modeling and Industrial Mathematics. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Theory of Computation. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY |
|---|
| Title |
Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| Relationship information |
Printed edition: |
| International Standard Book Number |
9780387955698 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE |
|---|
| Uniform title |
Monographs in Computer Science, |
| International Standard Serial Number |
0172-603X |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/b138114 |
| 912 ## - |
|---|
| -- |
ZDB-2-SCS |
