Theory of computation, Theory of Computation

Computations are deliberate for processing information. Computability theory was discovered in the 1930s, and extended in the 1950s and 1960s. Its basic ideas have become part of the foundation that any computer scientist is expected to know. The study of computation intended for providing an insight into the characteristics of computations. Such an insight may be used for predicting the difficulty of desired computations, for selecting the approaches they should take, and for developing tools that facilitate their design. Study of computation also provides tools for identifying problems that can possibly be solved, as well as tools for designing such solutions that is the field of computer sciences deals with the development of methodologies for designing programs and with the development of computers for the implementation of programs.

The study of computability also develops precise and well-defined language for communicating perceptive thoughts about computations. It reveals that there are problems that cannot be solved. And of the problems that can be solved, there are some that require infeasible amount of resources (e.g., millions of years of computation time). These revelations might seem discouraging, but they have the benefit of warning against trying to solve such problems. The study of computation provides approaches for identifying such problems are also provided by the study of computation.

Computation should be studied through medium of programs because programs are descriptions of computations. The clear understanding of computation and programs requires clear discussion of the following concepts

• "Alphabets, Strings, and Representation
• Formal languages and grammar
• Programs
• Problems
• Reducibility among problems"

Posted Date: 3/18/2013 12:53:56 AM | Location : United States







Related Discussions:- Theory of computation, Assignment Help, Ask Question on Theory of computation, Get Answer, Expert's Help, Theory of computation Discussions

Write discussion on Theory of computation
Your posts are moderated
Related Questions
Give the Myhill graph of your automaton. (You may use a single node to represent the entire set of symbols of the English alphabet, another to represent the entire set of decima


i want to do projects for theory of computation subject what topics should be best.

One of the first issues to resolve, when exploring any mechanism for defining languages is the question of how to go about constructing instances of the mechanism which define part

Proof (sketch): Suppose L 1 and L 2 are recognizable. Then there are DFAs A 1 = (Q,Σ, T 1 , q 0 , F 1 ) and A 2 = (P,Σ, T 2 , p 0 , F 2 ) such that L 1 = L(A 1 ) and L 2 = L(

We got the class LT by taking the class SL and closing it under Boolean operations. We have observed that LT ⊆ Recog, so certainly any Boolean combination of LT languages will also


1. Does above all''s properties can be used to prove a language regular? 2..which of the properties can be used to prove a language regular and which of these not? 3..Identify one

I want a proof for any NP complete problem

Kleene called this the Synthesis theorem because his (and your) proof gives an effective procedure for synthesizing an automaton that recognizes the language denoted by any given r