Alan Turing : his work and impact

In this 2013 winner of the prestigious R.R. Hawkins Award from the Association of American Publishers, as well as the 2013 PROSE Awards for Mathematics and Best in Physical Sciences & Mathematics, also from the AAP, readers will find many of the most significant contributions from the four-volum...

Celý popis

Uložené v:
Podrobná bibliografia
Hlavní autori: Turing, Alan Mathison, Cooper, S. B. (S. Barry), Leeuwen, Jan van
Médium: E-kniha Kniha
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier 2013
Elsevier Science & Technology
Elsevier Science
Vydanie:1
Predmet:
ISBN:9780123869807, 0123869803, 0123870127, 9780123870124
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In this 2013 winner of the prestigious R.R. Hawkins Award from the Association of American Publishers, as well as the 2013 PROSE Awards for Mathematics and Best in Physical Sciences & Mathematics, also from the AAP, readers will find many of the most significant contributions from the four-volume set of the Collected Works of A. M. Turing. These contributions, together with commentaries from current experts in a wide spectrum of fields and backgrounds, provide insight on the significance and contemporary impact of Alan Turing's work. Offering a more modern perspective than anything currently available, Alan Turing: His Work and Impact gives wide coverage of the many ways in which Turing's scientific endeavors have impacted current research and understanding of the world. His pivotal writings on subjects including computing, artificial intelligence, cryptography, morphogenesis, and more display continued relevance and insight into today's scientific and technological landscape. This collection provides a great service to researchers, but is also an approachable entry point for readers with limited training in the science, but an urge to learn more about the details of Turing's work. 2013 winner of the prestigious R.R. Hawkins Award from the Association of American Publishers, as well as the 2013 PROSE Awards for Mathematics and Best in Physical Sciences & Mathematics, also from the AAPNamed a 2013 Notable Computer Book in Computing Milieux by Computing ReviewsAffordable, key collection of the most significant papers by A.M. TuringCommentary explaining the significance of each seminal paper by preeminent leaders in the fieldAdditional resources available online
AbstractList In this 2013 winner of the prestigious R.R. Hawkins Award from the Association of American Publishers, as well as the 2013 PROSE Awards for Mathematics and Best in Physical Sciences & Mathematics, also from the AAP, readers will find many of the most significant contributions from the four-volume set of the Collected Works of A. M. Turing. These contributions, together with commentaries from current experts in a wide spectrum of fields and backgrounds, provide insight on the significance and contemporary impact of Alan Turing's work. Offering a more modern perspective than anything currently available, Alan Turing: His Work and Impact gives wide coverage of the many ways in which Turing's scientific endeavors have impacted current research and understanding of the world. His pivotal writings on subjects including computing, artificial intelligence, cryptography, morphogenesis, and more display continued relevance and insight into today's scientific and technological landscape. This collection provides a great service to researchers, but is also an approachable entry point for readers with limited training in the science, but an urge to learn more about the details of Turing's work. 2013 winner of the prestigious R.R. Hawkins Award from the Association of American Publishers, as well as the 2013 PROSE Awards for Mathematics and Best in Physical Sciences & Mathematics, also from the AAPNamed a 2013 Notable Computer Book in Computing Milieux by Computing ReviewsAffordable, key collection of the most significant papers by A.M. TuringCommentary explaining the significance of each seminal paper by preeminent leaders in the fieldAdditional resources available online
Includes a selection of writings by Alan Turing together with commentaries from current experts in a wide spectrum of fields and backgrounds.
Author Turing, Alan Mathison
Cooper, S. B. (S. Barry)
Leeuwen, Jan van
Author_xml – sequence: 1
  fullname: Turing, Alan Mathison
– sequence: 2
  fullname: Cooper, S. B. (S. Barry)
– sequence: 3
  fullname: Leeuwen, Jan van
BackLink https://cir.nii.ac.jp/crid/1130000797318120704$$DView record in CiNii
BookMark eNpV0M9LwzAUB_CITtzmzl4riOKh-pK85oe3WeYPGHgZXkuatq62trPpnH--2SaIObwQ8nmPx3dEjpq2yQk5o3BDgYrbmAGFEEIhuIKQHZCJlgoo40r6iod_b6EVyAEZ-QYGIJRQx2SoECL_QeGETJx7B3-UoBT5kJxPa9MEi3VXNm_BXbAsXbBpuyowTRaUHytj-1MyKEzt8snvPSavD7NF_BTOXx6f4-k8NDJCwJCh1hEUBpmVFCFTkqWMpTlmkUWbW1MUVmaiMBFNtUiVjAAlFqktuEAeUT4ml_vBrirr2rVFn6RtWzmG3zJJK-e3RpTAPLzeQ-OqfOOWbd275KvOdzr5l4y3V3u76trPde76ZMds3vSdqZPZfUyp1Aq1lxd72ZRlYsttpZRvs5Jacqp8nhKQ_wB-DGwV
ContentType eBook
Book
DBID RYH
DEWEY 510.92 B
DOI 10.1016/C2010-0-66380-2
DatabaseName CiNii Complete
DatabaseTitleList

DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISBN 9780123870124
0123870127
Edition 1
ExternalDocumentID bks00044702
9780123870124
EBC1179849
BB12504330
Genre Biography
Electronic books
GeographicLocations Great Britain
GeographicLocations_xml – name: Great Britain
GroupedDBID -VX
.64
.69
089
20A
38.
5O.
A4J
AAAAS
AABBV
AAFKH
AAGAK
AALIM
AALRI
AANYM
AAORS
AAVWF
AAXUO
AAZNM
ABARN
ABGWT
ABIAV
ABIWA
ABLXK
ABMAC
ABMRC
ABQNV
ABQPQ
ABQQC
ABRSK
ACHUA
ACLGV
ACXMD
ADCEY
ADVEM
AECLD
AEIOA
AERYV
AFOJC
AGAMA
AHWGJ
AIXPE
AJFER
AJMPQ
AKHYG
ALMA_UNASSIGNED_HOLDINGS
ALTAS
AMCAZ
AMINO
AMYDA
APVFW
ASVZH
ATDNW
AUHWD
AZZ
BADUN
BBABE
BIBTJ
BIOBC
BUTQF
CDLGT
CETPU
CZZ
DQACC
DUGUG
EBSCA
ECOWB
EFU
GEOUK
HGY
JJU
L7C
LLQQT
MYL
O7H
PQQKQ
QSTTX
RYH
SDK
SRW
UE6
XI1
ID FETCH-LOGICAL-a75404-249950fa42c7140d872b22be4d5c4cecaffc7d6fa51b96b8750474fbcf3643513
ISBN 9780123869807
0123869803
0123870127
9780123870124
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=0000273217&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Fri Aug 15 18:49:14 EDT 2025
Wed Oct 15 14:14:27 EDT 2025
Wed Nov 26 04:13:03 EST 2025
Thu Jun 26 23:01:54 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2012006868
LCCallNum QA29.T8 A43 2013eb
LCCallNum_Ident QA29.T8 C65 2013
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-a75404-249950fa42c7140d872b22be4d5c4cecaffc7d6fa51b96b8750474fbcf3643513
Notes Includes bibliographical references and index
Available also in a print ed.
Mode of access: Internet via World Wide Web.
Title from title screen.
OCLC 840569810
PQID EBC1179849
PageCount 937
ParticipantIDs skillsoft_books24x7_bks00044702
askewsholts_vlebooks_9780123870124
proquest_ebookcentral_EBC1179849
nii_cinii_1130000797318120704
PublicationCentury 2000
PublicationDate c2013
2013
2012-10-29
PublicationDateYYYYMMDD 2013-01-01
2012-10-29
PublicationDate_xml – year: 2013
  text: c2013
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
– name: Chantilly
– name: Boston
PublicationYear 2013
2012
Publisher Elsevier
Elsevier Science & Technology
Elsevier Science
Publisher_xml – name: Elsevier
– name: Elsevier Science & Technology
– name: Elsevier Science
RelatedPersons Turing, Alan Mathison, 1912-1954
RelatedPersons_xml – fullname: Turing, Alan Mathison, 1912-1954
SSID ssj0000861143
Score 2.2627366
Snippet In this 2013 winner of the prestigious R.R. Hawkins Award from the Association of American Publishers, as well as the 2013 PROSE Awards for Mathematics and...
Includes a selection of writings by Alan Turing together with commentaries from current experts in a wide spectrum of fields and backgrounds.
SourceID skillsoft
askewsholts
proquest
nii
SourceType Aggregation Database
Publisher
SubjectTerms Computer science
Computer science -- Mathematics
Enigma cipher system
Logic, Symbolic and mathematical
Mathematicians
Mathematicians -- Great Britain -- Biography
Mathematics
Turing, Alan Mathison
Turing, Alan Mathison, 1912-1954
SubjectTermsDisplay Computer science -- Mathematics.
Electronic books.
Enigma cipher system.
Logic, Symbolic and mathematical.
Mathematicians -- Great Britain -- Biography.
Turing, Alan Mathison, -- 1912-1954.
TableOfContents Front Cover -- Alan Turing: His Work and Impact -- Copyright -- List of Contributors -- Introduction -- Table of Contents -- Part I: How Do We Compute? What Can We Prove? -- Alan Mathison Turing by Max Newman -- A Comment on Newman's Biographical Memoir -- Alan Mathison Turing -- Scientific work -- 1. Mathematical logic -- '1. Computing machines -- 2. Three mathematical papers -- 3. Computing machines -- 4. Chemical theory of morphogenesis -- Bibliography -- On Computable Numbers, with an Application to the Entscheidungsproblem -- Alan and I -- On Computable Numbers, with an application to the entscheidungsproblem -- 1. Computing machines -- 2. Definitions -- Automatic machines -- Computing machines -- Circular and circle-free machines -- Computable sequences and numbers -- 3. Examples of computing machines -- 4. Abbreviated tables -- Further examples -- 5. Enumeration of computable sequences -- 6. The universal computing machine -- 7. Detailed description of the universal machine -- Subsidiary skeleton table -- 8. Application of the diagonal process -- 9. The extent of the computable numbers -- 10. Examples of large classes of numbers which are computable -- Computable convergence -- 11. Application to the Entscheidungsproblem -- Appendix -- Computability and effective calculability -- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction -- Examining the Work and Its Later Impact -- The Importance of Universal Computation -- References -- Three Proofs of the Unsolvability of the Entscheidungsproblem -- The Entscheidungsproblem -- 1. Church's Proof -- 2. Turing's Proof -- 3. The should-have-been Gödel-Kleene Proof -- References -- Two Puzzles About Computation -- 1. Introduction -- 2. Why Do We Compute? -- Problem 1 -- Problem 2 -- 3. What Do We Compute? -- Why Does It Matter? -- References
Jutaxposition and omitted points -- Application to Church's system -- Discussion of the conventions -- Examples -- The Reform of Mathematical Notation and Phraseology -- Computation, Mathematical Notation and Linguistics -- References -- The Reform of Mathematical Notation and Phraseology -- Free and bound variables. Deduction theorem. Constants and parameters -- Theory of types and domains of definition -- Discussion of the system and application to normal mathematics -- Examining the Work and Its Later Impact -- Turing, Wittgenstein and Types: Philosophical Aspects of Turing's 'The Reform of Mathematical -- References -- Part II: Hiding and Unhiding Information: Cryptology, Complexity and Number Theory -- On the Gaussian error function -- Alan Turing and the Central Limit Theorem -- 1. Introduction -- 2. The central limit theorem -- 3. Turing's fellowship dissertation -- 3.1. Basic structure of the paper -- 3.2. The Quasi-necessary conditions -- 3.3. The sufficient conditions -- 3.4. One counterexample -- 4. Discussion -- References -- Turing's 'Preface' (1935) to 'On the Gaussian error function' -- Some Calculations of the Riemann Zeta function -- Alan Turing and the Riemann Zeta Function -- 1. Introduction -- 2. Recollection of some basics -- 3. On Turing's computations of the zeta function -- 4. On Turing's early work with zeta -- 5. A return to basics -- 6. Turing's skepticism about the RH -- References -- A Few Comments About Turing's Method -- References -- Some Calculations of The Riemann Zeta-Function -- Introduction -- Part I. General -- 1. The Θ notation -- 2. The approximate functional equation -- 3. Principles of the calculations -- 4. Evaluation of N(t) -- Part II. The Computations -- 1. Essentials of the Manchester computer -- 2. Outline of calculation method -- References -- On a Theorem of Littlewood -- 1. Introduction
2. Outline of the method
4. Conscious cognition: discrete temporal frames -- 5. Conscious cognition: mind states -- 6. Trained phenomenology -- 7. Conclusion -- References -- Virtual Machinery and Evolution of Mind (Part 1) -- 1. Virtual machines and causation -- 2. Virtuality -- 3. Causation and computation -- 4. Causation in RVMs -- 5. Implementable but irreducible -- 6. Implications -- References -- NOT -- References -- Halting and Non-Halting Turing Computations -- 1. Introduction -- 2. Turing machines -- 3. Resources -- 4. Halting time -- 5. Final comments -- Acknowledgements -- References -- Toward the Unknown Region: On Computing Infinite Numbers -- References -- On Computable Numbers, with an Application to the Entscheidungsproblem by A. M. Turing - Review by: Alonzo Church -- Church's Review of Computable Numbers -- Reference -- Computability and λ-Definability -- The Imperative and Functional Programming Paradigm -- 1. Models of computation -- 2. Functional programming -- 2.1. Features from lambda calculus -- 2.2. Features beyond lambda calculus -- 3. Types -- 4. Input/output -- 5. Current research -- 5.1. Parallelism -- 5.2. Certification -- 6. History and perspective -- References -- Computability and λ-Definability -- 1. Definition of λ-K-definability -- 2. Abbreviations -- 3. Mechanical conversion -- 4. Computability of λ-K-definable functions -- 5. Recursiveness of computable functions. -- The p-Function in λ-K Conversion -- Turing's Contributions to Lambda Calculus -- 1. Fixed point combinators in untyped lambda calculus -- 1.1. Lambda terms, reduction, and conversion -- 1.2. Fixed points -- 2. Weak normalisation of simply typed lambda calculus -- 2.1. Simply typed lambda terms and reduction -- 2.2. The proof of weak normalisation -- 2.3. Strong normalisation -- 3. Postscript -- References -- The p-Function in λ-K-Conversion
Systems of Logic Based on Ordinals -- Turing's Thesis: Ordinal Logics and Oracle Computability -- 1. From Cambridge to Princeton -- 2. Turing in Princeton -- 3. The thesis: ordinal logics -- 4. Ordinal logics redux -- References -- Systems of Logic Based on Ordinals -- 1. The calculus of conversion. Gödel representations. -- 2. Effective calculability. Abbreviation of treatment. -- 3. Number-theoretic theorems. -- 4. A type of problem which is not number-theoretic. -- 5. Syntactical theorems as number-theoretic theorems. -- 6. Logic formulae. -- 7. Ordinals. -- 8. Ordinal logics. -- 9. Completeness questions. -- Definition of completeness of an ordinal logic -- Invariance of ordinal logics -- Incompleteness theorems. -- 10. The continuum hypothesis. A digression. -- 11. The purpose of ordinal logics. -- 12. Gentzen type ordinal logics. -- Index of definitions. -- Bibliography -- Examining the Work and Its Later Impact -- Turing's 'Oracle' in Proof Theory -- 1. Realisability -- 2. Heyting arithmetic in higher types -- 3. Realisability relative to an oracle -- References -- Truth and Turing -- References -- A Quantum Random Oracle -- 1. Turing's oracles -- 2. Value indefiniteness and the Kochen-Specker Theorem -- 3. An example of a quantum random oracle -- 4. A quantum random number generator certified by value indefiniteness -- 5. Hypercomputation via quantum random oracles -- References -- Practical Forms of Type Theory -- Preface -- Practical Forms of Type Theory -- 1. The nested-type system for a finite universe -- 2. Formal account of the nested-type system -- 3. Equivalence with Church's system -- 4. Relaxation of type notation -- The use of Dots as Brackets in Church's System -- Turing's dots -- The Use of Dots as Bracketsin Church's System -- General bracketing theory -- First form of rule -- Second form of rule -- Equivalence theorem
Turing Machines and Understanding Computational Complexity -- 1. Introduction -- 2. Formal definition of the Turing machine -- 2.1. Computable functions -- 2.2. Examples of computable functions -- 3. Computability thesis and the universal Turing machine -- 4. Undecidability of the halting problem -- 5. Complexity of computations -- 6. Importance of the Turing machine -- References -- From the Halting Problem to the Halting Probability -- Turing and the Art of Classical Computability -- 1. Mathematics as an art -- 2. Defining the effectively calculable functions -- 3. Why Turing and not Church? -- 4. Why Michelangelo and not Donatello? -- 5. Classical art and classical computability -- 5.1. Human scale -- 5.2. Composition and balance -- 6. Computability and recursion -- 7. The art of exposition -- 8. Conclusion -- References -- Turing Machines in Münster -- 1. Introduction -- 2. The object -- 2.1. Hardware layout -- 2.2. Examples -- 3. The papers -- 3.1. Universal Turing machines and Jones-Matiyasevich-masking -- 3.2. On the early history of register machines -- 4. Conclusion -- 5. State machine -- References -- Reflections on Wittgenstein's Debates with Turing During his Lectures on the Foundations of Mathematics -- References -- The Computational Power of Turing's Non-Terminating Circular a-Machines -- 1. Introduction -- 2. a-Machines and red-green Turing machines -- 2.1. a-Machines -- 2.2. Red-green Turing machines -- 2.3. Relation between a-machines and red-green Turing machines -- 3. Significance of the result -- 4. Conclusion -- Acknowledgements -- References -- Turing's Approach to Modelling States of Mind -- Acknowledgements -- References -- Conscious Cognition as a Discrete, Deterministic and Universal Turing Machine Process -- 1. Systems with states -- 2. The Turing machine: processes and computation -- 3. The neural Turing machine
TemporalSubjectTerms 1912-1954
Title Alan Turing : his work and impact
URI https://cir.nii.ac.jp/crid/1130000797318120704
https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=1179849
https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9780123870124&uid=none
http://www.books24x7.com/marc.asp?bookid=44702
WOSCitedRecordID wos0000273217&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLdYQYKexpcoYyMgbigjThx_cGzVDYltcCjTbpHtOFrUKp3qrvTP37Pjpus4IA5crHwocfueY__ee37vh9AnAqY_TUr40hSlMRG4jAUtyxgbIhWVWCvvGrg8YxcX_OpK_AysrNbTCbCm4eu1uPmvqoZroGyXOvsP6u5eChfgGJQOLagd2geIuDsN-41n8K1O2rRDZ-hf19YzwbTxAZ8Nud1NsQhcJv6hc09LvA3Ij-bzm0DIdfx5eOxQqDuQCxdz7zwHZ8bc_g65HfCSVRhnwYXg6Bx2XAib3JYd09JhLU4Fbzlp_5hoW5t_1MbSY4AtPAlpjLvVq4dD3BZJS_bQHpg2PfT4dPzj1_fODwYmFZhkma92FHrMQmGk7hdsSjJh-uVBj33Ul3YKywEsFUsL-KCp6x1b4amd1rOZhSXtHmyY7KOeSyV5jh6Z5gXqn3cVcu1L9MEJPmr1EH2NQPyR01UEuopaXb1ClyfjyehbHOgqYskA95IYLFmRJ5UkqXZlEEvOUpWmypAy10QbLatKs5JWMsdKUMVdZX1GKqWrDHBhjrPXqNfMG_MGRWlWYqKZzLWAWVVJbgShhEmqkzw3aTJAH-_972I186F1W2zExqAlA3QI4ih07Vrs4pYACB1VGYA6mOnhfrQRVOGfD_uBi_Fw5CoFciIG6H0nwMJ3kZI1K9TU-q0ALEnf_qWTA_RsO-Teod5ycWsO0RO9WtZ2cRRGwx3iujl0
linkProvider ProQuest Ebooks
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Alan+Turing+%3A+his+work+and+impact&rft.au=Turing%2C+Alan+Mathison&rft.au=Cooper%2C+S.+B.+%28S.+Barry%29&rft.au=Leeuwen%2C+Jan+van&rft.date=2013-01-01&rft.pub=Elsevier&rft.isbn=9780123869807&rft_id=info:doi/10.1016%2FC2010-0-66380-2&rft.externalDocID=BB12504330
thumbnail_m http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97801238%2F9780123870124.jpg