A personal account of Turing's imprint on the development of computer science
type: Item
instance of: scholarly article
title: A personal account of Turing's imprint on the development of computer science
zbMATH Open document ID: 1298.68017
published in: Computer Science Review
publication date: 2014-10-24T00:00:00Z
Mathematics Subject Classification ID: 68-03
Mathematics Subject Classification ID: 01A60
Mathematics Subject Classification ID: 01A70
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03D10
zbMATH DE Number: 6361018
zbMATH Keywords: Alan Turing
zbMATH Keywords: Turing machine
MaRDI profile type: Publication
full work available at URL: j.cosrev.2012.11.001
OpenAlex ID: W2147789522
cites work: Alan Turing and the Central Limit Theorem
cites work: ROUNDING-OFF ERRORS IN MATRIX PROCESSES
cites work: The Legacy of Turing in Numerical Analysis
cites work: Some Calculations of the Riemann Zeta-Function
cites work: Q5450054
cites work: The chemical basis of morphogenesis
cites work: Q3327698
cites work: Ancient Babylonian algorithms
cites work: Q5508959
cites work: Q5389951
cites work: Q4510371
cites work: Turing's cathedral. The origins of the digital universe
cites work: Q5573940
cites work: Logicomix. An epic search for truth. Character design and drawings by Alecos Papadatos, color by Annie Di Donna
cites work: Q4792066
cites work: Q4781159
cites work: Babbage as a computer pioneer
cites work: Charles Babbage's Analytical Engine, 1838
cites work: From Analytical Engine to Electronic Digital Computer: The Contributions of Ludgate, Torres, and Bush
cites work: A short account on Leonardo Torres' endless spindle
cites work: Q4884709
cites work: Q4507904
cites work: Q4842677
cites work: Q3259070
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem
cites work: Formalism and intuition in computability
cites work: Systems of Logic Based on Ordinals†
cites work: Uncle Petros and Goldbach's conjecture. Translated from the 1992 Greek original
cites work: Q5573961
cites work: Q3996675
cites work: The upper semi-lattice of degrees of recursive unsolvability
cites work: Emil Post and His Anticipation of Gödel and Turing
cites work: Q3584678
cites work: Closing the Circle: An Analysis of Emil Post's Early Work
cites work: Q3090774
cites work: Q3823798
cites work: Q4325269
cites work: Formal Reductions of the General Combinatorial Decision Problem
cites work: A variant of a recursively unsolvable problem
cites work: Recursively enumerable sets of positive integers and their decision problems
cites work: The computer as von Neumann planned it
cites work: The other Turing machine
cites work: An Early Program Proof by Alan Turing
cites work: Closed timelike curves make quantum and classical computing equivalent
cites work: Why there is no such discipline as hypercomputation
DOI: 10.1016/J.COSREV.2012.11.001
author: J. Díaz
author: C. Torras
description: scientific article; zbMATH DE number 6361018