Results 1  10
of
30
Artificial Life
"... Living organisms are extraordinary. They have capabilities which far exceed any presentday technology, and it is therefore inevitable that scientists and engineers should seek to emulate at least some of those capabilities in artificial systems. Such an endeavour not only offers the possibility of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, and the emerging field of synthetic biology. All three topics reveal surprising, and sometimes remarkably deep, connections between the apparently disparate disciplines of biology and computer science. There is something else which links these three strands: the Cambridge mathematician Alan Turing (see Figure 1
The Military Use of Alan Turing
"... Alan Turing (19121954), British mathematician, was critical in the Anglo; American decipherment of German communications in the Second World War. This experience enabled him to formulate an original plan for the digital computer in 1945, based on his own 1936 concept of the universal machine. He w ..."
Abstract
 Add to MetaCart
Alan Turing (19121954), British mathematician, was critical in the Anglo; American decipherment of German communications in the Second World War. This experience enabled him to formulate an original plan for the digital computer in 1945, based on his own 1936 concept of the universal machine. He
Alan Turing and the Mathematical Objection
 Minds and Machines 13(1
, 2003
"... Abstract. This paper concerns Alan Turing’s ideas about machines, mathematical methods of proof, and intelligence. By the late 1930s, Kurt Gödel and other logicians, including Turing himself, had shown that no finite set of rules could be used to generate all true mathematical statements. Yet accord ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract. This paper concerns Alan Turing’s ideas about machines, mathematical methods of proof, and intelligence. By the late 1930s, Kurt Gödel and other logicians, including Turing himself, had shown that no finite set of rules could be used to generate all true mathematical statements. Yet
Collected Works of Alan Turing Morphogenesis Universal Turing Machine
"... Recent advances in semantic technology and mobile theory interfere in order to accomplish Lamport clocks. Given the current status of mobile configurations, mathematicians famously desire the robust unification of IPv6 and kernels that paved the way for the evaluation of semaphores. Our focus in our ..."
Abstract
 Add to MetaCart
Recent advances in semantic technology and mobile theory interfere in order to accomplish Lamport clocks. Given the current status of mobile configurations, mathematicians famously desire the robust unification of IPv6 and kernels that paved the way for the evaluation of semaphores. Our focus
1. Turing’s legacy Computation Beyond Turing Machines
"... Alan Turing was a brilliant mathematician who showed that computers could not completely prove mathematical assertions, extending Gödel’s proof that logic could not completely model mathematical truth. This connection between computers and mathematics was later used to develop a mathematical foundat ..."
Abstract
 Add to MetaCart
Alan Turing was a brilliant mathematician who showed that computers could not completely prove mathematical assertions, extending Gödel’s proof that logic could not completely model mathematical truth. This connection between computers and mathematics was later used to develop a mathematical
Case Sudy 2: Turing’s model of chemical morphogenesis
, 2005
"... Alan Turing (19121954) has been described as the founder of computer science. He was a mathematician whose ideas about computability ushered in the computer age. (For some background, go to ..."
Abstract
 Add to MetaCart
Alan Turing (19121954) has been described as the founder of computer science. He was a mathematician whose ideas about computability ushered in the computer age. (For some background, go to
How to pass the Turing test by cheating
 In Elisabeth Maier, Marion Mast, and Susan LuperFoy (Eds), Dialogue Processing in Spoken Language Systems
, 1996
"... Back in the heyday of computer hardware, some notable people actually believed that sentient computer programs were literally just around the corner. This prompted the great British mathemetician, Alan Turing, to devise a simple test of intelligence. If a computer program could pass the Turing test ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Back in the heyday of computer hardware, some notable people actually believed that sentient computer programs were literally just around the corner. This prompted the great British mathemetician, Alan Turing, to devise a simple test of intelligence. If a computer program could pass the Turing
A Turing program for linguistic theory
 Biolinguistics
, 2012
"... Universal to systems so various and complex as the foundations of mathematics, cryptography, computer science, artificial intelligence, and morphogenesis is the “the concept of ‘mechanical procedure ’ (alias ‘algorithm ’ or ‘computation procedure ’ or ‘finite combinatorial procedure’). This concept ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
of the mathematician Alan Mathison Turing (1912–1954).1 The mathematical universality of the Turing machine — the abstract system of computation — implies that it is not only relevant to biolinguistic research, but intrinsic to linguistic — indeed any cognitiveneurobiological — computation. To demonstrate
Session 11 Turing’s Lure, Gödel’s Curse
"... Linear systems are well understood and completely predictable, whatever the initial state and no matter what is the system dimension. But if the system is nonlinear then different situation will be faced, and the theory of linear systems no longer is valid. It has been shown that the resulting behav ..."
Abstract
 Add to MetaCart
function. That was before the advent of digital computers. One of those mathematicians is Alan Turing
The ChurchTuring thesis: Still valid after all these years
 pp.93–102 in Applied Mathematics and Computation vol.178
, 2006
"... Abstract This paper discusses whether recent proposals for socalled hypercomputation would, if realised in practice, invalidate the ChurchTuring thesis. Ó 2005 Elsevier Inc. All rights reserved. Keywords: Turing machine; ChurchTuring thesis; Hypercomputation What is the ChurchTuring thesis? In ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
? In 1936, the English mathematician Alan Turing published a groundbreaking paper entitled ''On computable numbers, with an application to the Entscheidungsproblem'' A Turing machine is a mechanism that performs calculations by reading and writing symbols on an unbounded linear tape
Results 1  10
of
30