Results 241 to 250 of about 23,795 (258)
Some of the next articles are maybe not open access.
Communications of the ACM, 2014
Assessing the accuracy of popular descriptions of Alan Turing's influences and legacy.
openaire +4 more sources
Assessing the accuracy of popular descriptions of Alan Turing's influences and legacy.
openaire +4 more sources
2015
We make the case that computing is increasingly compromised by Turing’s heritage of strictly sequential algorithms, and the time has come to seek radically different computing paradigms. Whilst we are unable to offer any instant solutions, we point to the existence proof of the vast, distributed, asynchronous networks of computing elements that form ...
Furber, Steve, Brown, Andrew
openaire +2 more sources
We make the case that computing is increasingly compromised by Turing’s heritage of strictly sequential algorithms, and the time has come to seek radically different computing paradigms. Whilst we are unable to offer any instant solutions, we point to the existence proof of the vast, distributed, asynchronous networks of computing elements that form ...
Furber, Steve, Brown, Andrew
openaire +2 more sources
Alan Turing and the Turing Machine
1990Abstract By marking its fiftieth anniversary, this volume recognizes the long-lasting influence of the Turing machine concept. By collecting together new contributions from so many fields, it signals the exceptionally wide scope of that influence. This brief essay, intended to recall and honor the person of Alan M.
openaire +1 more source
Alan Turing and the Turing Test
2007The study of Alan Turing’s life and work shows how the origin of the Turing Test lies in Turing’s formulation of the concept of computability and the question of its limits.
openaire +2 more sources
2015
The Turing machine convincingly formalized the concepts of “algorithm,” “computation,” and “computable.” It convinced researchers by its simplicity, generality, mechanical operation, and resemblance to human activity when solving computational problems, and by Turing’s reasoning and analysis of “computable” functions and his argumentation that partial “
openaire +2 more sources
The Turing machine convincingly formalized the concepts of “algorithm,” “computation,” and “computable.” It convinced researchers by its simplicity, generality, mechanical operation, and resemblance to human activity when solving computational problems, and by Turing’s reasoning and analysis of “computable” functions and his argumentation that partial “
openaire +2 more sources
ACM SIGNUM Newsletter, 1985
Numerical Turing is an extension of the Turing programming language. Turing is a Pascal-like language (with convenient string handling, dynamic arrays, modules and more general parameter lists) developed at the University of Toronto [4]. Turing has been in use since May, 1983, and is now available on several machines.
T. E. Hull +6 more
openaire +2 more sources
Numerical Turing is an extension of the Turing programming language. Turing is a Pascal-like language (with convenient string handling, dynamic arrays, modules and more general parameter lists) developed at the University of Toronto [4]. Turing has been in use since May, 1983, and is now available on several machines.
T. E. Hull +6 more
openaire +2 more sources
Turing’s Thesis and the Universality of the Turing Machine
2002In this chapter, we investigate Turing’s thesis, which essentially says that the Turing machine (TM) is the most powerful computational device of all. We find evidence to support the thesis by considering a special TM called the Universal TM (UTM).
openaire +2 more sources
2017
Turing was awarded the Order of the British Empire in June of 1946. Most people thought that the award was a well deserved mark of recognition honoring the mathematician who had given a successful definition of mechanical procedure, had introduced the universal machine capable of simulating all mechanical procedures, and had settled in the negative ...
Mundici, Daniele, Sieg, Wilfried
openaire +3 more sources
Turing was awarded the Order of the British Empire in June of 1946. Most people thought that the award was a well deserved mark of recognition honoring the mathematician who had given a successful definition of mechanical procedure, had introduced the universal machine capable of simulating all mechanical procedures, and had settled in the negative ...
Mundici, Daniele, Sieg, Wilfried
openaire +3 more sources
2012
We enhance the notion of a computation of the classical theory of computing with the notion of interaction from concurrency theory. In this way, we enhance a Turing machine as a model of computation to a Reactive Turing Machine that is an abstract model of a computer as it is used nowadays, always interacting with the user and the world.
Baeten, J.C.M. +2 more
openaire +3 more sources
We enhance the notion of a computation of the classical theory of computing with the notion of interaction from concurrency theory. In this way, we enhance a Turing machine as a model of computation to a Reactive Turing Machine that is an abstract model of a computer as it is used nowadays, always interacting with the user and the world.
Baeten, J.C.M. +2 more
openaire +3 more sources