|
|
|
|
| LEADER |
03443nam a22004935i 4500 |
| 001 |
978-3-319-22156-4 |
| 003 |
DE-He213 |
| 005 |
20160121195826.0 |
| 007 |
cr nn 008mamaa |
| 008 |
160121s2015 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319221564
|9 978-3-319-22156-4
|
| 024 |
7 |
|
|a 10.1007/978-3-319-22156-4
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA8.9-10.3
|
| 072 |
|
7 |
|a PBC
|2 bicssc
|
| 072 |
|
7 |
|a PBCD
|2 bicssc
|
| 072 |
|
7 |
|a MAT018000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 511.3
|2 23
|
| 245 |
1 |
0 |
|a Turing’s Revolution
|h [electronic resource] :
|b The Impact of His Ideas about Computability /
|c edited by Giovanni Sommaruga, Thomas Strahm.
|
| 250 |
|
|
|a 1st ed. 2015.
|
| 264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Birkhäuser,
|c 2015.
|
| 300 |
|
|
|a XXIV, 329 p. 18 illus., 1 illus. in color.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 505 |
0 |
|
|a Preface (Martin Davis).-I Introduction (Sommaruga, Strahm).-II Turing and the history of computability theory -- 1. Conceptual Confluence in 1936: Post & Turing, Martin Davis and Wilfried Sieg -- 2. Algorithms: From Al-Khwarizmi to Turing and Beyond, Wolfgang Thomas -- 3. The Stored-Program Universal Computer: Did Zuse Anticipate Turing and von Neumann? Jack Copeland and Giovanni Sommaruga -- III Generalizing Turing computability theory -- 1. Theses for Computation and Recursion on Concrete and Abstract Structures, Solomon Feferman -- 2. Generalizing Computability Theory to Abstract Algebras, John V. Tucker and Jeffrey Zucker -- 3. Discrete Transfinite Computation, Philip Welch -- 4. Semantics-to-Syntax Analyses of Algorithms, Yuri Gurevich -- 5. The Information Content of Typical Reals, George Barmpalias and Andy Lewis-Pye -- 6. Proof-theoretic Analysis by Iterated Reflection, Lev Beklemishev.-IV Philosophical reflections -- 1. Alan Turing and the Foundation of Computer Science, Juraj Hromkovic -- 2. Proving Things about the Informal, Stewart Shapiro -- 3. Why Turing’s Thesis is Not a Thesis, Robert Soare -- 4. Incomputability, Emergent, and Higher Type Computation, S. Barry Cooper.
|
| 520 |
|
|
|a This book provides an overview of the confluence of ideas in Turing’s era and work and examines the impact of his work on mathematical logic and theoretical computer science. It combines contributions by well-known scientists on the history and philosophy of computability theory as well as on generalised Turing computability. By looking at the roots and at the philosophical and technical influence of Turing’s work, it is possible to gather new perspectives and new research topics which might be considered as a continuation of Turing’s working ideas well into the 21st century.
|
| 650 |
|
0 |
|a Mathematics.
|
| 650 |
|
0 |
|a Logic.
|
| 650 |
|
0 |
|a History.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
1 |
4 |
|a Mathematics.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Foundations.
|
| 650 |
2 |
4 |
|a History of Mathematical Sciences.
|
| 650 |
2 |
4 |
|a Logic.
|
| 700 |
1 |
|
|a Sommaruga, Giovanni.
|e editor.
|
| 700 |
1 |
|
|a Strahm, Thomas.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783319221557
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-319-22156-4
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SMA
|
| 950 |
|
|
|a Mathematics and Statistics (Springer-11649)
|
