MARC details
000 -LEADER |
fixed length control field |
05128nam a22005415i 4500 |
001 - CONTROL NUMBER |
control field |
978-0-387-68546-5 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
DE-He213 |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20170628033327.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 |
100301s2008 xxu| s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9780387685465 |
-- |
978-0-387-68546-5 |
024 7# - OTHER STANDARD IDENTIFIER |
Standard number or code |
10.1007/978-0-387-68546-5 |
Source of number or code |
doi |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
Classification number |
QA76.9.M35 |
072 #7 - SUBJECT CATEGORY CODE |
Subject category code |
UYAM |
Source |
bicssc |
072 #7 - SUBJECT CATEGORY CODE |
Subject category code |
UFM |
Source |
bicssc |
072 #7 - SUBJECT CATEGORY CODE |
Subject category code |
COM018000 |
Source |
bisacsh |
072 #7 - SUBJECT CATEGORY CODE |
Subject category code |
MAT003000 |
Source |
bisacsh |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
004.0151 |
Edition number |
23 |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Cooper, S. Barry. |
Relator term |
editor. |
245 10 - TITLE STATEMENT |
Title |
New Computational Paradigms |
Medium |
[electronic resource] : |
Remainder of title |
Changing Conceptions of What is Computable / |
Statement of responsibility, etc |
edited by S. Barry Cooper, Benedikt Löwe, Andrea Sorbi. |
264 #1 - |
-- |
New York, NY : |
-- |
Springer New York, |
-- |
2008. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
XIV, 560 p. |
Other physical details |
online resource. |
336 ## - |
-- |
text |
-- |
txt |
-- |
rdacontent |
337 ## - |
-- |
computer |
-- |
c |
-- |
rdamedia |
338 ## - |
-- |
online resource |
-- |
cr |
-- |
rdacarrier |
347 ## - |
-- |
text file |
-- |
PDF |
-- |
rda |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
The Turing Model of Computation and its Applications to Logic, Mathematics, Philosophy, and Computer Science -- Alan Turing, Logical and Physical -- Computability and Numberings -- Computation as Conversation -- Computation Paradigms in Light of Hilbert's Tenth Problem -- Elementary Algorithms and Their Implementations -- Applications of the Kleene–Kreisel Density Theorem to Theoretical Computer Science -- Church Without Dogma: Axioms for Computability -- Computability on Topological Spaces via Domain Representations -- On the Power of Broadcasting in Mobile Computing -- Logic, Algorithms and Complexity -- The Computational Power of Bounded Arithmetic from the Predicative Viewpoint -- Effective Uniform Bounds from Proofs in Abstract Functional Analysis -- Effective Fractal Dimension in Algorithmic Information Theory -- Metamathematical Properties of Intuitionistic Set Theories with Choice Principles -- New Developments in Proofs and Computations -- Models of Computation from Nature -- From Cells to (Silicon) Computers, and Back -- Computer Science, Informatics, and Natural Computing—Personal Reflections -- Computable Analysis and Real Computation -- A Survey on Continuous Time Computations -- A Tutorial on Computable Analysis -- A Continuous Derivative for Real-Valued Functions -- Infinite Time Computable Model Theory. |
520 ## - SUMMARY, ETC. |
Summary, etc |
In recent years, classical computability has expanded beyond its original scope to address issues related to computability and complexity in algebra, analysis, and physics. The deep interconnection between "computation" and "proof" has originated much of the most significant work in constructive mathematics and mathematical logic of the last 70 years. Moreover, the increasingly compelling necessity to deal with computability in the real world (such as computing on continuous data, biological computing, and physical models) has brought focus to new paradigms of computation that are based on biological and physical models. These models address questions of efficiency in a radically new way and even threaten to move the so-called Turing barrier, i.e. the line between the decidable and the un-decidable. This book examines new developments in the theory and practice of computation from a mathematical perspective, with topics ranging from classical computability to complexity, from biocomputing to quantum computing. The book opens with an introduction by Andrew Hodges, the Turing biographer, who analyzes the pioneering work that anticipated recent developments concerning computation’s allegedly new paradigms. The remaining material covers traditional topics in computability theory such as relative computability, theory of numberings, and domain theory, in addition to topics on the relationships between proof theory, computability, and complexity theory. New paradigms of computation arising from biology and quantum physics are also discussed, as well as the computability of the real numbers and its related issues. This book is suitable for researchers and graduate students in mathematics, philosophy, and computer science with a special interest in logic and foundational issues. Most useful to graduate students are the survey papers on computable analysis and biological computing. Logicians and theoretical physicists will also benefit from this book. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computer science. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Information theory. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Logic, Symbolic and mathematical. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Quantum theory. |
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computer Science. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Math Applications in Computer Science. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Theory of Computation. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Mathematical Logic and Foundations. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Philosophy. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Quantum Physics. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Quantum Information Technology, Spintronics. |
700 1# - ADDED ENTRY--PERSONAL NAME |
Personal name |
Löwe, Benedikt. |
Relator term |
editor. |
700 1# - ADDED ENTRY--PERSONAL NAME |
Personal name |
Sorbi, Andrea. |
Relator term |
editor. |
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 |
Display text |
Printed edition: |
International Standard Book Number |
9780387360331 |
856 40 - ELECTRONIC LOCATION AND ACCESS |
Uniform Resource Identifier |
<a href="http://dx.doi.org/10.1007/978-0-387-68546-5">http://dx.doi.org/10.1007/978-0-387-68546-5</a> |
912 ## - |
-- |
ZDB-2-SCS |