Search results
Jump to navigation
Jump to search
Page title matches
- [[Image:Turing memorial.jpg|right|300px|Memorial to Alan Turing]] ...titled "Computing Machinery and Intelligence",<ref>{{cite paper |author = Alan Turing| title = Computing Machinery and Intelligence | date = 1950 | url = http://5 KB (782 words) - 05:57, 8 April 2024
- 93 bytes (10 words) - 21:04, 1 November 2008
- ...| last = Hodges | first = Andrew | origyear = 1983 | year = 1992 | title = Alan Turing: the enigma |location = London | publisher=Burnett Books | isbn = 0-04-5100209 bytes (25 words) - 09:08, 22 June 2012
- 754 bytes (103 words) - 14:41, 18 March 2024
- * [http://www.turing.org.uk/bio/part1.html Alan Turing: a short biography] by [http://www.synth.co.uk/ Andrew Hodges]. ...o the eight sections of my full biography, [http://www.turing.org.uk/book/ Alan Turing: the enigma]."2 KB (262 words) - 09:56, 23 June 2012
Page text matches
- * [http://www.turing.org.uk/bio/part1.html Alan Turing: a short biography] by [http://www.synth.co.uk/ Andrew Hodges]. ...o the eight sections of my full biography, [http://www.turing.org.uk/book/ Alan Turing: the enigma]."2 KB (262 words) - 09:56, 23 June 2012
- #Redirect [[Alan Turing]]25 bytes (3 words) - 16:43, 30 October 2008
- #Redirect [[Alan Turing]]25 bytes (3 words) - 16:44, 30 October 2008
- A theoretical computing device, first posited by mathematician [[Alan Turing]], which has been used extensively in analyzing computing problems such as223 bytes (28 words) - 11:50, 4 July 2009
- A test for [[artificial intelligence]] proposed by [[Alan Turing]]; if a computer can handle conversation well enough to appear human, then210 bytes (29 words) - 23:19, 1 November 2008
- ...| last = Hodges | first = Andrew | origyear = 1983 | year = 1992 | title = Alan Turing: the enigma |location = London | publisher=Burnett Books | isbn = 0-04-5100209 bytes (25 words) - 09:08, 22 June 2012
- {{r|Alan Turing}}470 bytes (62 words) - 21:07, 11 January 2010
- | author = [[Alan Turing]] is a theoretical computing device, first posited by mathematician [[Alan Turing]], which has been used extensively in analyzing computing problems such as3 KB (492 words) - 09:10, 22 May 2011
- {{r|Alan Turing}}823 bytes (105 words) - 11:04, 11 January 2010
- ...the German [[Enigma machine]]s. The most famous of the code-breakers was [[Alan Turing]].360 bytes (50 words) - 07:23, 24 February 2024
- [[Image:Turing memorial.jpg|right|300px|Memorial to Alan Turing]] ...titled "Computing Machinery and Intelligence",<ref>{{cite paper |author = Alan Turing| title = Computing Machinery and Intelligence | date = 1950 | url = http://5 KB (782 words) - 05:57, 8 April 2024
- {{r|Alan Turing}}297 bytes (41 words) - 16:47, 30 October 2008
- {{r|Alan Turing}}455 bytes (59 words) - 17:44, 3 September 2008
- {{r|Alan Turing}}605 bytes (77 words) - 14:41, 18 March 2024
- {{r|Alan Turing}}715 bytes (96 words) - 02:45, 25 November 2010
- {{r|Alan Turing}}661 bytes (87 words) - 17:04, 11 January 2010
- ...a negative answer to the Halting Problem in the [[Alonzo Church|Church]]-[[Alan Turing|Turing]] Thesis.3 KB (449 words) - 15:23, 12 August 2008
- {{r|Alan Turing}}868 bytes (124 words) - 17:35, 14 March 2024
- {{r|Alan Turing}}1 KB (173 words) - 14:49, 4 April 2024
- {{R|Alan Turing}}2 KB (194 words) - 14:48, 4 April 2024
- * [[Alan Turing|Turing, Alan]] (1912-1954) - theory of computability4 KB (515 words) - 09:39, 10 November 2008
- [[Alan Turing]], a Cambridge mathematician known at Bletchley as "prof" was one of the ke5 KB (854 words) - 05:49, 8 April 2024
- ...n the form of the [[Church-Turing Thesis]] (due to [[Alonzo Church]] and [[Alan Turing]]). This theorem proved that no systematic method exists, ''or can ever ex6 KB (988 words) - 00:43, 6 February 2010
- ...ry and Intelligence" More info is at: [http://www.turing.org.uk/turing The Alan Turing Home Page]9 KB (1,250 words) - 19:40, 18 October 2013
- * [[Alan Turing]]5 KB (699 words) - 04:28, 1 October 2013
- ...ions for the theory of machine computation was laid down by Alonzo Church, Alan Turing, and others in the 1930s. And when practical computing machines became avai10 KB (1,529 words) - 16:45, 10 February 2024
- ...ields, such as by the mathematicians [[Paul Erdős]], [[Horace Lamb]] and [[Alan Turing]], the author [[Anthony Burgess]], philosophers [[Ludwig Wittgenstein]] and * £56 m [[Alan Turing Building]]: housing Mathematics, the Photon Sciences Institute and the [[Jo26 KB (3,819 words) - 22:07, 11 October 2013
- ...olution, pioneered by brilliant twentieth-century mathematicians such as [[Alan Turing]] (among many others), enabled the invention of electronic computers. And a9 KB (1,333 words) - 10:08, 28 February 2024
- ...l achievements are the undecidability of the [[Entscheidungsproblem]] by [[Alan Turing]], and his presentation of the [[Church-Turing thesis]]. Today recursion t Logic cut to the heart of computer science as it emerged as a discipline: [[Alan Turing]]'s work on the [[Entscheidungsproblem]] followed from [[Kurt Gödel]]'s wo32 KB (4,979 words) - 21:47, 12 November 2011
- [[Image:Turing memorial.jpg|left|200px|Memorial to Alan Turing]] Security aspects have led to tragedies, such as that of [[Alan Turing]],<ref>{{citation36 KB (5,247 words) - 05:49, 8 April 2024
- ...may not be computable at all; in fact, this can be proven. For instance, [[Alan Turing|Turing]] showed in 1936 that there is no algorithm for deciding in finite t27 KB (4,383 words) - 08:05, 11 October 2011
- Much work on the theory of computation was done in the 1930s. [[Alan Turing]] and [[Alonzo Church]] both came up with new techniques to solve the [[hal26 KB (3,913 words) - 06:51, 7 April 2014
- ...esearch. The first was the creation of the [[computer]] and the ideas of [[Alan Turing]]. People quickly saw the analogy between computers and the [[human]] [[bra19 KB (2,748 words) - 14:04, 1 April 2024
- ...For example, [[Turing Machine]] cites the classic TM paper, and perhaps [[Alan Turing]] should as well, but the dozens of other places where it is relevant shoul66 KB (10,879 words) - 17:02, 5 March 2024
- 1936 [[Alan Turing]]'s ''On Computable Numbers''[http://www.comlab.ox.ac.uk/activities/ieg/e-l54 KB (7,884 words) - 12:15, 14 February 2024
- *[[Alan Turing]] and [[Tommy Flowers]], inventors of the modern computer and its associate ...omson]], [[Charles Babbage]], [[Stephen Hawking]], [[Christopher Wren]], [[Alan Turing]], [[Francis Crick]], [[Joseph Lister]], [[Tim Berners-Lee]], [[Andrew Wile75 KB (11,181 words) - 07:31, 20 April 2024