This year a series of events around the world will celebrate the work of Alan Turing, the father of the modern computer, as the 100th anniversary of his birthday approaches on June 23. In a book ...
We are at a critical time and supporting science journalism is more important than ever. Science News and our parent organization, the Society for Science, need your help to strengthen scientific ...
Refusing to choose between science and engineering? B: David, what is the result you are the most proud of? DH: Besides my five children and five grandchildren, in terms of scientific contribution, I ...
Charles Petzold's book The Annotated Turing, which covers Turing's 1936 paper on computable numbers and much of the background material needed to understand it, is more than decent. As a result, I was ...
Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...
University of Massachusetts Amherst computer scientist Hava Siegelmann has received funding to develop the first ever “Super-Turing” computer. Based on analog recurrent neural networks, Siegelmann ...
The introduction to computer pioneer Alan Turing by philosopher and leading Turing scholar Copeland reveals a life too complex for a short volume. Described by his mother as an “unsociable and dreamy ...
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ...
Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be computable, creating the field of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results