is any1 there to tell me about Turing machine??
930139
here in IIT kharagpur ... theory of computaion by  "michel sipser" is folllowing ..and i think it is the best book ..written by  a MIT prof ...
978671
[i]  = I\n[d]s = does (without the s it would be do)\n[t]  = to or the\n[o] = of\n\nAnyway I think all the [ ] are suppose to be abbreviations and these are the most likely.◘
142824
Theory of computation\nFrom Wikipedia, the free encyclopedia\n\nThe theory of computation is the branch of computer science that deals with whether and how efficiently problems can be solved on a computer. The field is divided into two major branches: computability theory and complexity theory, but both branches deal with formal models of computation.\n\nIn order to perform a rigorous study of computation, computer scientists work with a mathematical abstractions of computers called a model of computation. There are several formulations in use, but the most commonly examined is the Turing machine. A Turing machine can be thought of as a desktop PC with an infinite memory capacity, though it can only access this memory in small discrete chunks. Computer scientists study the Turing machine because it is simple to formulate, can be analyzed and used to prove results, and because it represents what many consider the most powerful possible "reasonable" model of computation. While the infinite memory capacity might be considered an unphysical attribute, for any problem actually solved by a Turing machine the memory used will always be finite, so any problem that can be solved on a Turing machine could be solved on a desktop PC which has enough memory installed.
24046
Hello,\n\nPlease see http://en.wikipedia.org/wiki/History_of_computing for a great article with many links to learning about the history of computing on my favorite site Wikipedia.org. \n\nIf you feel that I've answered your question please close your question so I can receive points for my answer. \n\nThanks,\n\nV
411671
It's called CAPTCHA - Completely Automated Public Turing Test to Tell Computers and Humans Apart\n\nhttp://www.captcha.net/\n\nhttp://en.wikipedia.org/wiki/Captcha
314789
How to work it? It's not very difficult. You just need to write your code and compile it.\n\nUnfortunately I can't send you anything, but you can check out my first source for more information.
529151
A non terminating infinite loop is usually considered an error.\n\nHowever there are some applications which are infinite loops on purpose. The are usually servers for event driven applications. Consider web servers. They loop infinitely until a request comes to them. They process the request and go back to their loop waiting for the next request.\n\nInfinite loops can be nasty, so early computer theorist wondered if there was a way to detect them. In fact certain problems could be solved if we could tell if a program went into an infinite loop or not.\n\nAlan Turing, one of the founders of computer science, provide the "halting problem." It answered the question, and he proved that one couldn't write a program which could determine if a general program contained an infinite loop or not.\n\nThe proof (by contradiction) goes along these lines.\n\nAssume program, P, exists, and it reads another program, p, and tests it for infinite loops. It exhibits the following behavior:\n\nP(p) prints "Halts" if p halts.\n\nP(p) prints "Does not halt" if p does not halt.\n\nPretty straight forward assumption... ok?\n\nNow, let's modify P to make a new program P', that does almost the same things as P, but just slightly different.\n\nP'(p) goes into an infinite loop itself if p halts.\n\nP'(p) halts if p goes into an infinite loop.\n\nBasically, P' does the opposite of p.\n\nSince P' works on any program, let's run the following:\n\nP'(P') - basically have P' test itself. What does it do?\n\nIf P' halts, then P' doesn't halt.\nIf P' doesn't halt, then P' halts.\n\nIt can't do something and not do that thing at the same time. It's a contradiction, which unravels back to the assumption that P can exist.\n\nTherefore P cannot exist.
520415
Learn assembler\n\nuse softice or linice to read memory changes\n\n\nsee what changes what and where then make a proggy to manipulate values in the memory.
495947
i am intrigued by your idea of LOGIC!!! interesting
509576
It's a recursive function that's not primitive recursive.\n\nIt grows extremely fast.  See the Wikipedia entry.
257065
Hey Alex, There are several area's of AI and in each there are  several "good" AI algorithms.  If your simply looking for something interersting to study I recommend looking into searching algorithms.  More specifically a very interesting introductory algorithm you could look at is The minimax algorithm with alpha-beta pruning.  Not only is this a fun algorithm to work through, you will learn several usefull ideas that apply to fields from Artificial Intelligence through to Computational Genetics.  There are of course hundreds more but this was my one of my first AI algorithms and I learned a lot from it.  If you are looking for a good introductory text to Artificial Intelligence I recommend "Artificial Intelligence: A modern approach" by Stuart Russen and Peter Norvig.  Hope this helps and good luck.
1108238
I can provide you complete programs of data structures (linked list, array handling, stacks, queues, tress, graphs, and other algorithms). for this you have to provide me your information and details for what purpose you have to use this? and what your are doing currently. you can communicate me on my email address. abhi_patni@yahoo.com.
79803
you will find everything you want here:\n\nhttp://en.wikipedia.org/wiki/Logic_gates
6162
A computer is an information-processing machine that works by converting all kinds of information into binary numbers (ones and zeros) and then using simple mathematics to make decisions about, or to rearrange, those numbers. There are two things essential to understanding the basics of how a computer works. One is that a computer treats any type of information (not only numbers but also letters, words, dates, and so on) as if it consisted simply of binary ones and zeros. For example, a computer can translate the letter “A” typed into its keyboard into a string of ones and zeros, such as 1000001. One reason to do this is that once in binary form, the information can be stored and moved about more easily.
132075
There is a good explanation on wikipedia:\n\nhttp://en.wikipedia.org/wiki/Semaphore_%28programming%29
150391
It is a strings proccessing alg which uses a failure function to improve the run time rather than bm alg\nrun time:m+n\nm:the length of the pattern\nn: the length of the text\nwe use tis algorithm to find the pat string in the text string..\nmore details \nmail me at ziko@math.com\ni can provid a pascal source for it
818604
Never heard of it.  Have you tried Mathworld or Wikipedia?