Results 1 - 15 of about 392 sawaal for "turing"
Well , Turing test is a hypothetical test for computer intelligence, proposed by Alan Turing in 1950, involving a computer program generating a conversation which could not be distinguished from of minds that are artificially produced.For more details , Please visit the source site :http://en.wikipedia.org/wiki/T uringtest...Well,The Turing Test is a hypothetical test for determining whether or not a
Posted in
Computers & Technology by jks marven at 12:54 PM on May 15, 2008
A Turing machine is a simple but powerful computer. It is useful in thinking about the nature and limits of computability because its method of computation is about as simple as can be imagined. Important theoretical results about what can be computed that are expressed in the terms of Turing machines, therefore, are clearer to intuition than the same results expressed in other terms.Turing machines
Posted in
Computers & Technology by Ramiz Ahmed at 7:48 PM on December 16, 2008
Turing machine, a mathematical model of a device that computes via a series of discrete steps and is not limited in use by a fixed maximum amount of data storage. Introduced by the British mathematician Alan Turing Turing, Alan Mathison, 191254, British mathematician and computer theorist. While studying at Cambridge Univ. he began work in predicate logic that lead to a proof 1937 that some
Posted in
Computers & Technology by Ramiz Ahmed at 7:52 PM on December 16, 2008
of cors bilkul bilkul...I feel very sorry to say this...that TRUE word does not exits in this world today....nothing is true aaj-kal...everythings fake..people are with each other for their own needs and wants....but eah true love...in very rare cases i have seen few girls and boys who love their par
Posted in
Delhi by Salman Khan at 8:01 PM on August 11, 2008
A test devised by the English mathematician Alan M. Turing to determine whether or not a computer can be said to think like a human brain. In an attempt to cut through the philosophical debate about how to define thinking, Turing devised a subjective test to answer the question, Can machines think? and reasoned that if a computer acts, reacts and interacts like a sentient being, then call
Posted in
Computers & Technology by paromita at 11:59 PM on October 26, 2007
The Turing test is a proposal for a test of a machine's capability to demonstrate intelligence. Described by Professor Alan Turing in the 1950 paper ''Computing machinery and intelligence), the conversation is usually limited to a text-only channel such as a teletype machine as Turing suggested or, more recently, IRC or instant messaging. Answered by: alokgupta14 at 7:26 PM on October 26, 2007
Posted in
Computers & Technology by at 11:59 PM on October 26, 2007
The lambda calculus, an important precursor to formal computability theory, was developed by Alonzo Church and Stephen Cole Kleene. Alan Turing is most often considered the father of modern computer science, and laid many of the important foundations of computability and complexity theory, including the first description of the Turing machine in [1...], 1936 as well as many of the important early
Posted in
Computers & Technology by rahul sen at 7:41 PM on December 16, 2008
Short for completely automated public Turing test to tell computers and humans apart, a technique used by a computer to tell if it is interacting with a human or another computer. Because computing, such as gathering e-mail addresses for spamming or ordering hundreds of tickets to a concert....Completely Automated Public Turing test to tell Computers and Humans Apart A category of technologies used to ensure
Posted in
Computers & Technology by paromita at 11:55 PM on October 26, 2007
Classical computability theory originated with the seminal work of G&246;del, Church, Turing, Kleene and Post in the 1930s, and includes a wide spectrum of topics, such as the theory.Basic to recent developments in the subject is the theory of relative computability. This classifies real numbers according to the Turing reducibility relation a < b meaning a is computable from knowledge of b
Posted in
Computers & Technology by mahesh patil at 7:55 PM on December 16, 2008
....well anurag many are their like contest2win...pribes2win.com......m oola.com ...but ibib.com is best for cash which can be earned thru sawaal .......Hi , it is ture there are many online earnings website. Like://www.clicksalary.com/pages/in dex.php?refid=dineshsharma2 http://cash-hi.com/pages/index.php? refid=dineshsharma3 http://www.mginger.com/index.jsp?in viteId=93404 Hi , it is ture there are many online earnings website. Like ibibo
Posted in
Computers & Technology by Anurag at 7:31 PM on October 20, 2008
The halting problem is easy to solve, however, if we allow that the Turing machine that decides it may run forever when given input which is a representation of a Turing machine that does not itself is the complement of the halting language; that is the language consisting of all Turing machines paired with input strings where the Turing machines do not halt on their input. To see that this language
Posted in
Computers & Technology by rahul sen at 7:42 PM on December 16, 2008
, for example, deterministic finite automata, push-down automata, multitape automata and weighted automata. Turing machines can also be regarded as automata. So called tree automata are a very special form are not regular and ways to test languages for non-regularity.Later we are going to learn an extension of finite automata called Turing machines. Though Turing machines are simple modification of finite automata
Posted in
Computers & Technology by John Ronald at 11:39 PM on October 06, 2008
in 1981. Benioff theorized about creating a quantum Turing machine. Most digital computers, like the one you are using to read this article, are based on the Turing Theory.Defining the Quantum ComputerThe Turing machine, developed by Alan Turing in the 1930s, is a theoretical device that consists of tape of unlimited length that is divided into little squares. Each square can either hold a symbol 1 or 0
Posted in
Electronics & Gadgets by harish at 5:11 AM on January 16, 2008
Charless Babbage...Charls Babge is known as father of Computer...Alan Mathison Turing, Turing is often considered to be the father of modern computer science. Turing provided an influential formalisation of the concept of the algorithm and computation with the Turing machine, formulating the now widely accepted Turing version of the ChurchTuring thesis, namely that any practical computing model has
Posted in
Computers & Technology by nisha at 10:44 PM on September 22, 2007
& A | Report Abuse Rate this : 0 0... Alan Mathison Turing, Turing is often considered to be the father of modern computer science. Turing provided an influential formalisation of the concept of the algorithm and computation with the Turing machine, formulating the now widely accepted Turing version of the ChurchTuring thesis, namely that any practical computing model has either the equivalent or a
Posted in
Computers & Technology by Mumbai at 10:44 PM on September 22, 2007
