「Turing」の共起表現一覧(1語右で並び替え)
該当件数 : 200件
| Park, is chaired by S. Barry Cooper, with Alan | Turing's nephew Sir John Dermot Turing acting as TCAC |
| ouse, on 25 June 2010, he paid tribute to Alan | Turing, and Gordon Brown's official apology for the s |
| The Man Who Knew Too Much: Alan | Turing and the Invention of the Computer (2005) |
| and worked on the Pilot ACE computer with Alan | Turing and others. |
| y three historical figures: mathematician Alan | Turing and novelists Graham Greene and Joseph Heller |
| basic questions of the kind considered by Alan | Turing, and of interdisciplinary developments related |
| butions of Charles Babbage, Ada Lovelace, Alan | Turing, and others. |
| Researchers such as | Turing and Konrad Zuse investigated the idea of using |
| He is the Director of the | Turing Archive for the History of Computing, an exten |
| eferenced in memos dated from 1950 at the Alan | Turing Archive . |
| Turing Award - Donald Knuth | |
| Turing Award - Robert Floyd | |
| Turing Award - Niklaus Wirth | |
| Turing Award - A.J. Perlis | |
| Turing Award - Robin Milner | |
| Turing Award - John Backus | |
| Turing Award - Richard Hamming | |
| Turing Award - Douglas Engelbart | |
| 1973 ACM | Turing Award lecture. |
| Turing Award - Edgar F. Coddk | |
| Turing Award - Kenneth E. Iverson | |
| Turing Award - Maurice Vincent Wilkes | |
| Turing Award - Edward Feigenbaum, Raj Reddy | |
| Turing Award - C. A. R. Hoare | |
| Turing Award - Ken Thompson, Dennis Ritchie | |
| E. Allen Emerson, winner of the 2007 | Turing Award |
| Ritchie's | Turing Award lecture was titled "Reflections on Softw |
| hih Yao, a Chinese computer scientist and A.M. | Turing Award laureate. |
| Clarke, Emerson, and Sifakis shared the 2007 | Turing Award for their work on model checking. |
| TerraServer was the brainchild of the | Turing Award winning researcher on database systems, |
| Robert Kahn: (2:25-2:35, 3:15-6:25, 6:55-) | Turing Award winner. |
| well-known theoretical computer scientist and | Turing Award winner. |
| doctoral student to graduate at Stanford under | Turing Award winner and AI pioneer, John McCarthy. |
| the Royal Society in 1988 and received the ACM | Turing Award in 1991. |
| He was awarded the | Turing Award in 1966, according to the citation, for |
| In 1996, Pnueli received the | Turing Award for seminal work introducing temporal lo |
| He won the 2007 A.M. | Turing Award along with Edmund M. Clarke and Joseph S |
| Amongst many awards, he received the | Turing Award in 1990, "for his pioneering work in org |
| ntist and cognitive scientist who received the | Turing Award in 1971 for his major contributions to t |
| a Rajagopal "Raj" Reddy (born June 13, 1937) a | Turing Award winner, is one of the early pioneers in |
| er the supervision of Juris Hartmanis, another | Turing award winner at Cornell. |
| Ritchie and Ken Thompson jointly received the | Turing Award for their development of generic operati |
| Liskov received the 2008 | Turing Award from the ACM for her work in the design |
| theory of algorithms, for which he received a | Turing Award in 1985, The Benjamin Franklin Medal in |
| ocke won the Eckert-Mauchly Award in 1985, ACM | Turing Award in 1987, the National Medal of Technolog |
| for Computing Machinery as national lecturer, | Turing Award chairman, member of the publications pla |
| o, with Juris Hartmanis, received the 1993 ACM | Turing Award "in recognition of their seminal paper w |
| A. M. | Turing Award, Association for Computing Machinery (19 |
| The | Turing Award, the "Nobel Prize of Computer Science", |
| He received the ACM | Turing Award, the most prestigious award in computer |
| kis Theory and Practice Award and the 2002 ACM | Turing Award, often called the Nobel Prize of Compute |
| (voice 0:45-1:15, face 1:00-1:15, 15:10-15:40) | Turing Award-winning implementer of multitasking oper |
| He is also the only Indian to win the | Turing Award. |
| mming languages and the first recipient of the | Turing Award. |
| tore proposed by several researchers including | Turing, Bauer and Hamblin, and first implemented in 1 |
| The atrium of the Alan | Turing Building |
| The Alan | Turing Building at the University of Manchester |
| w phase in July 2007 with the move to the Alan | Turing Building |
| School of Mathematics moved in to its new Alan | Turing Building, where a lecture room is named in his |
| Davis (2000) says that | Turing built a binary multiplier out of electromechan |
| To mark the 100th anniversary of | Turing's birth, the Turing Centenary Advisory Committ |
| n Computability in Europe, and is Chair of the | Turing Centenary Advisory Committee (TCAC) which is c |
| cted to issue a UK commemorative stamp for the | Turing centenary. |
| ich is the case if the programming language is | Turing complete). |
| It was | Turing complete, with conditional branching, and prog |
| SSI is | Turing complete. |
| uage with the normalization property cannot be | Turing complete. |
| herefore programming model could be considered | Turing complete. |
| -level grammars have actually been shown to be | Turing complete. |
| ot, which was the first machine designed to be | Turing complete? |
| Turing completeness | |
| Turing completeness in SQL is implemented through pro | |
| recursion theory, 0 can be used to denote the | Turing degree of the partial computable functions. |
| ng been the focus of AI since the days of Alan | Turing, directly tracing back to the work of Gottlob |
| recursive functions defined by Church, Kleene, | Turing, etc. (See Indeterminacy in concurrent computa |
| Turing+ extended original Turing with processes and m | |
| Turing had an important influence on computing, compu | |
| Turing+ has been used to implement several production | |
| les of this kind of hierarchical "glue" at The | Turing Hub. |
| y recruits to Bletchley (the others being Alan | Turing, Hugh Alexander, and Stuart Milner-Barry), who |
| Church then | Turing identified the computational core of the incom |
| ulability" based on his λ calculus and by Alan | Turing in the same year with his concept of Turing ma |
| written in Concurrent Euclid, was recoded to | Turing+ in its MiniTunis implementation. |
| Working with an old college friend Alan | Turing in 1948, he helped develop one of the first ch |
| part of the initiation activities of the Alan | Turing Institute. |
| Thus this argument (as | Turing intends) is invalid. |
| Turing is shown holding an apple-a symbol classically | |
| Turing is shown holding an apple-a symbol classically | |
| first name there; the two exceptions were Alan | Turing, known as Prof, and F.A. Kendrick, who he was |
| In January 2005 he gave the IEE/BCS annual | Turing Lecture in London on the subject of "Collabora |
| Computing of this kind that goes beyond the | Turing Limit is called hypercomputation. |
| The (2,3) | Turing machine also requires an infinite non-repeatin |
| All the observer needs to do is to prime the | Turing machine to signal to p if and only if the Turi |
| A log space transducer (LST) is a type of | Turing machine used for log-space reductions. |
| denote by U(e, x) the action of the universal | Turing machine given a description number e and input |
| e solved in polynomial time by a probabilistic | Turing machine but not a deterministic Turing machine |
| omputational complexity theory, an alternating | Turing machine (ATM) is a non-deterministic Turing ma |
| It turns out that allowing the | Turing machine to be nondeterministic does not add an |
| The decision problem of whether the | Turing machine with index e will halt on every input |
| n of acceptance of a string by a probabilistic | Turing machine can be defined in different ways. |
| apable of settling the halting problem, i.e. a | Turing machine TEST(e) which given the description nu |
| Feynman showed that a classical | Turing machine would presumably experience an exponen |
| Since λ lies in p's past, the | Turing machine can signal (a solution) to p at any st |
| An alternating | Turing machine in polynomial time with k alternations |
| An alternating | Turing machine (or to be more precise, the definition |
| is a formal language for which there exists a | Turing machine (or other computable function) which w |
| A | Turing machine solves a range problem if, for any x, |
| if the | Turing machine has halted, then write 1 on the first |
| In computer science, a turmite is a | Turing machine which has an orientation as well as a |
| is a formal language for which there exists a | Turing machine which will, when presented with any fi |
| ith some kind of control mechanism to obtain a | Turing machine powerful grammatical device. |
| fter receiving it, it will iterate the desired | Turing machine for that many steps, and accept or rej |
| . Hennie and R. E. Stearns showed that given a | Turing machine Mα that halts on input x within N step |
| mputationally equivalent to a nondeterministic | Turing machine restricted to the portion of the tape |
| It differs from a | Turing machine in that while the tape is initially co |
| boundary k is the sequence of the states of a | Turing machine in which it is at the moments when its |
| only if it can be solved by a nondeterministic | Turing machine in polynomial time. |
| It is easy to see that this | Turing machine will generate all and only the sentent |
| n be shown to be in NL, as a non-deterministic | Turing machine can guess the next node of the path, w |
| g acceptance is unchanged: a non-deterministic | Turing machine accepts a string if, when the machine |
| Wolfram described a universal 2-state 5-color | Turing machine, and conjectured that a particular 2-s |
| Given some | Turing machine, it is possible to create an unrestric |
| s (abbreviated ZM, and also called Accelerated | Turing machine, ATM) are a hypothetical computational |
| ivalent with a linear bounded nondeterministic | Turing machine, also called a linear bounded automato |
| model of computers that actually exist than a | Turing machine, whose definition assumes unlimited ta |
| results in complexity, the smallest universal | Turing Machine, and the shortest axiom for propositio |
| Fuchs was a member of the bands | Turing Machine, The Juan MacLean, !!! and Maserati an |
| achine, a pushdown automaton or a full-fledged | Turing machine, a state is a particular set of instru |
| maller ordinals in such a way that a computer ( | Turing machine, say) can manipulate them (and, essent |
| An artistic representation of a | Turing Machine. |
| The best-known example is the | Turing machine. |
| llowing article is a supplement to the article | Turing machine. |
| each of its computers could be simulated by a | Turing machine. |
| y simple computational model equivalent to the | Turing machine. |
| uivalent in computational power to a universal | Turing machine. |
| that Conway's Game of Life could function as a | Turing machine. |
| hich is known to be undecidable by an ordinary | Turing machine. |
| band Pitchblende; this band would later become | Turing Machine. |
| computers are usually of the form of a simple | Turing machine; there is analogous hardware, in the f |
| Or can deterministic | Turing machines efficiently simulate all probabilisti |
| ms of Alonzo Church's lambda calculus and Alan | Turing's Turing machines provided mathematical abstra |
| similar to the Church-Kleene ordinal, but for | Turing machines with oracles. |
| ce δ is built up from what we have assumed are | Turing machines as well then it too must have a descr |
| . Brady considered the idea of two-dimensional | Turing machines with an orientation and called them " |
| r similar to the Church-Kleene ordinal but for | Turing machines with oracles. |
| the set of all problems that can be solved by | Turing machines using at most t(n) space for some fun |
| e invented in 1986 and declared "equivalent to | Turing machines". |
| Prof. Dr. Kees Schouhamer Immink, | Turing Machines, Netherlands |
| In the case of these types of | Turing Machines, the only movement is to the right. |
| As in the definition of | Turing machines, it possesses a tape made up of cells |
| (i.e. that it can efficiently simulate quantum | Turing machines, some arbitrary quantum circuit or si |
| ows computations that cannot be implemented by | Turing Machines, as seen above. |
| The park contains the Alan | Turing memorial statue, which depicts the "father of |
| numents elsewhere in the city include the Alan | Turing Memorial situated in Sackville Park, adjacent |
| barrister from Stockport, who set up the Alan | Turing Memorial Fund in order to raise the necessary |
| Twinn worked with | Turing on breaking the German Naval Enigma. |
| Laboratory in 1946, where he worked with Alan | Turing on the ACE computer project. |
| The | Turing Option, with Harry Harrison, Warner Books, New |
| The | Turing programming language is a direct descendant of |
| ilosophy of SP/k was a strong influence on the | Turing programming language. |
| Concurrent Euclid programming language and the | Turing programming language. |
| Holt was one of the original developers of the | Turing programming language, Grok programming languag |
| In 1936 and 1937 Alonzo Church and Alan | Turing respectively, published independent papers sho |
| ke the challenge of designing a UTM exactly as | Turing specified see the article by Davies in Copelan |
| e smallest letters in those two alphabets) are | Turing tarpits, esoteric programming languages that a |
| He has published several papers on Alan | Turing's Turing Test and Turing's the mathematical Tu |
| Note that the | Turing test is used to evaluate a machine's capabilit |
| Other | Turing Test approaches include a simple problem, or a |
| fiction; one published example is the 1993 The | Turing Test short story.) |
| comment that "He provides a rationale for the | Turing test which knits together the motivational rem |
| The | Turing Test matches computer scientist judges against |
| The | Turing Test is a BBC Books original novel written by |
| by Mondrian was an early implementation of the | Turing Test and an example of the use of digital comp |
| behaviour', an argument which anticipates the | Turing test published in 1950 to test a machine's cap |
| include Chair, mathematician S. Barry Cooper, | Turing's biographer Andrew Hodges; Wendy Hall, first |
| ram's output has been produced by a human (the | Turing test). |
| a, which competed in the internationally known | Turing test, for the coveted Loebner Prize. |
| nding, origin of language, lateralization, the | Turing test, distributed cognition, scientometrics, a |
| trand Russell's "On Denoting" (1905), and Alan | Turing's "Computing Machinery and Intelligence" (1950 |
| e of humanness in the world's first restricted | Turing test. |
| The | Turing Test: The Elusive Standard of Artificial Intel |
| Parsing the | Turing Test: Philosophical and Methodological Issues |
| es is perhaps best known as the author of Alan | Turing: The Enigma, the story of the British computer |
| ialised codebreaking machines designed by Alan | Turing, the so-called "bombes", were ready for use. |
| al acting career playing the lead role of Alan | Turing, the gay mathematician, in the play Breaking t |
| tures, differential equations proposed by Alan | Turing to explain how chemical reactions could create |
| of the members of the Berlin committee, began | turing towards communism. |
| Turing used seven symbols { A, C, D, R, L, N, ; } to | |
| The mathematician Alan | Turing was born there in 1912. |
| Turing+ was explicitly designed to replace Concurrent | |
| A frequent misconception is that | Turing was a key figure in the design of Colossus; th |
| ssity for Optimum programming (favored by Alan | Turing) was to be minimised, "because it tended to be |
| nd sentenced to 2 years' hard labour, and Alan | Turing was convicted under it and sentenced to chemic |
| Some, but not all, of the features of | Turing+ were eventually subsumed into Object-Oriented |
| bridge, where the computer room is named after | Turing, who became a student there in 1931 and a Fell |
| assed the 30% mark - the threshold set by Alan | Turing, who devised the Turing Test in 1950 on which |
| r of modern computing, Tommy Flowers; and Alan | Turing, who probably saved Britain by breaking the En |
| The | Turing Year is coordinated by the Turing Centenary Ad |
| The Alan | Turing Year, 2012, will be a celebration of the life |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
