°¬Âס¤Í¼Áé:ËûµÄ¹¤×÷ÓëÓ°Ïì:his work and impact

List of ContributorsIntroductionPart I How Do We Compute What Can We Prove 1955 Alan Matbison Turing by Max Newman£¨Bibliographic Memoirs of the Fellows of the Royal Society£¬ 1 £¨Nov£®£©£¬253-263£©Andrew Hodges contributes¡ª¡ªA Comment on Newman's Biographical MemoirBiographical Memoir1936-7 On Computable Numbers£¬ with an Application to the Entscheidungsproblem£¨Proc£® Lond£® Math£® Soc£® £¨2£©42£¬ 230-265£©1937 - A Correction £¨ibid£º 43£¬ 544-546£©Christos Papadimitriou on ¡ª¡ªAlan and ITuring textsStephen Wolfram on ¡ª¡ªThe Importance of Universal ComputationMartin Davis illuminates ¡ª¡ªThree Proofs of the Unsolvability of the EntscheidungsproblemSamson Abramsky detects ¡ª¡ªTwo Puzzles About ComputationPaul Vitanyi illustrates the importance of Turing Machines and Understanding Computational ComplexityGregory Chaitin traces the path ¡ª¡ªFrom the Halting Problem to the Halting ProbabilityRobert Irving Soare expands on ¡ª¡ªTuring and the Art of Classical ComputabilityRainer Glaschick takes us on a trip back toTuring Machines in MunsterFrom K£® Vela Velupillai ¡ª¡ªReflections on Wittgenstein's Debates with Turing during his Lectures on the Foundations of MathematicsJan van Leeuwen and Jiri Wiedermann on ¡ª¡ªThe Computational Power of Turing's Non-Terminating Circular a-MachinesMeurig Beynon puts an empirical slant on ¡ª¡ªTuring's Approach to Modelling States of MindHenk Barendregt and Antonio Raffone explore ¡ª¡ªConscious Cognition as a Discrete£¬ Deterministic and Universal Turing Machine ProcessAaron Sloman develops a distinctive view of¡ª¡ªVirtual Machinery and Evolution of Mind £¨Part 1£©Artur Ekert on the physical reality of ¡ª¡ªNOTCristian Calude£¬ Ludwig Staiger and Michael Stay on ¡ª¡ªHalting and Non-Halting Turing ComputationsPhilip Welch leads us¡ª¡ªToward the Unknown Region£º On Computing Infinite Numbers1937 On Computable Numbers£¬ with an Application to the Entscheidungsproblem by A£® M£® Turing - Review by£ºAlonzo Church£¨J£®Symb£®Log£®2£¬42£©Andrew Hodges finds significance in ¡ª¡ªChurch's Review of Computable Numbers1937 Computability and ¦Ë-Definability£¨J£® Symb£® Log£® 2£¬ 153-63£©Henk Barendregt£¬ Giulio Manzonetto and Rinus Plasmeijertrace through to today ¡ª¡ªThe Imperative and Functional Programming ParadigmTuring text1937 The p-Function in ¦Ë-K Conversion£¨J£®Symb£®Log£®2£¬164£©Henk Barendregt and Giulio Manzonetto point out the subtleties of¡ª¡ªTuring's Contributions to Lambda CalculusTuring textPart ¢ò Hiding and Unhiding Information£º Cryptoloty£¬Complexity and Unmber TheoryPart ¢ó Building a Brain£º Intelligent Machines£¬Practice and TheoryPart ¢ô The Mathematics of Emergence£º The Mysteries of MorphogenesisAfterwordBibliographyIndex