Theory of computation, Theory of Computation

Assignment Help:

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"


Related Discussions:- Theory of computation

Define ambiguity in cfg, Define the following concept with an example: a.  ...

Define the following concept with an example: a.    Ambiguity in CFG b.    Push-Down Automata c.    Turing Machine

Finite state automata, Since the signi?cance of the states represented by t...

Since the signi?cance of the states represented by the nodes of these transition graphs is arbitrary, we will allow ourselves to use any ?nite set (such as {A,B,C,D,E, F,G,H} or ev

Myhill graph of the automaton, Exercise:  Give a construction that converts...

Exercise:  Give a construction that converts a strictly 2-local automaton for a language L into one that recognizes the language L r . Justify the correctness of your construction.

Give a strictly 2-local automaton, Let L 3 = {a i bc j | i, j ≥ 0}. Give ...

Let L 3 = {a i bc j | i, j ≥ 0}. Give a strictly 2-local automaton that recognizes L 3 . Use the construction of the proof to extend the automaton to one that recognizes L 3 . Gi

Production, How useful is production function in production planning?

How useful is production function in production planning?

Pojects idea, i want to do projects for theory of computation subject what ...

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

Non Regular, Prove that Language is non regular TRailing count={aa ba aaaa...

Prove that Language is non regular TRailing count={aa ba aaaa abaa baaa bbaa aaaaaa aabaaa abaaaa..... 1) Pumping Lemma 2)Myhill nerode

#titl, matlab v matlab

matlab v matlab

Transition and path functions, When an FSA is deterministic the set of trip...

When an FSA is deterministic the set of triples encoding its edges represents a relation that is functional in its ?rst and third components: for every q and σ there is exactly one

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd