東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Turing's revolution = the impact of ...

Sommaruga, Giovanni.

FindBook

Google Book

Amazon

博客來

Turing's revolution = the impact of his ideas about computability /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Turing's revolution/ edited by Giovanni Sommaruga, Thomas Strahm.
其他題名:	the impact of his ideas about computability /
其他作者:	Sommaruga, Giovanni.
出版者:	Cham :Springer International Publishing : : 2015.,
面頁冊數:	xxiv, 329 p. :ill. (some col.), digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Computer science - Mathematics. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-22156-4
ISBN:	9783319221564$q(electronic bk.)

Turing's revolution = the impact of his ideas about computability /
Turing's revolutionthe impact of his ideas about computability /[electronic resource] :edited by Giovanni Sommaruga, Thomas Strahm. - Cham :Springer International Publishing :2015. - xxiv, 329 p. :ill. (some col.), digital ;24 cm.

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.

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.

ISBN: 9783319221564$q(electronic bk.)

Standard No.: 10.1007/978-3-319-22156-4doiSubjects--Personal Names:

607020
Turing, Alan Mathison,
1912-1954.Subjects--Topical Terms:

532725
Computer science
--Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Turing's revolution = the impact of his ideas about computability /
LDR:02809nmm a2200325 a 4500 001 2016636
003 DE-He213
005 20160526103012.0
006 m d
007 cr nn 008maaau
008 160613s2015 gw s 0 eng d
020 $a 9783319221564$q(electronic bk.)
020 $a 9783319221557$q(paper)
024 7 $a 10.1007/978-3-319-22156-4 $2 doi
035 $a 978-3-319-22156-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35
072 7 $a PBC $2 bicssc
072 7 $a PBCD $2 bicssc
072 7 $a MAT018000 $2 bisacsh
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.M35 $b T938 2015
245 0 0 $a Turing's revolution $h [electronic resource] : $b the impact of his ideas about computability / $c edited by Giovanni Sommaruga, Thomas Strahm.
260 $a Cham : $b Springer International Publishing : $b Imprint: Birkhauser, $c 2015.
300 $a xxiv, 329 p. : $b ill. (some col.), digital ; $c 24 cm.
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.
600 1 0 $a Turing, Alan Mathison, $d 1912-1954. $3 607020
650 0 $a Computer science $x Mathematics. $3 532725
650 0 $a Computable functions. $3 559829
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Mathematical Logic and Foundations. $3 892656
650 2 4 $a History of Mathematical Sciences. $3 1530523
650 2 4 $a Logic. $3 529544
700 1 $a Sommaruga, Giovanni. $3 1005546
700 1 $a Strahm, Thomas. $3 2165781
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-22156-4
950 $a Mathematics and Statistics (Springer-11649)