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
Our primary concern is to obtain a clear characterization of which languages are recognizable by strictly local automata and which aren't. The view of SL2 automata as generators le

The SL 2 languages are speci?ed with a set of 2-factors in Σ 2 (plus some factors in {?}Σ and some factors in Σ{?} distinguishing symbols that may occur at the beginning and en

Prepare the consolidated financial statements for the year ended 30 June 2011. On 1 July 2006, Mark Ltd acquired all the share capitall of john Ltd for $700,000. At the date , J

It is not hard to see that ε-transitions do not add to the accepting power of the model. The underlying idea is that whenever an ID (q, σ  v) directly computes another (p, v) via

Let L1 and L2 be CGF. We show that L1 ∩ L2 is CFG too. Let M1 be a decider for L1 and M2 be a decider for L2 . Consider a 2-tape TM M: "On input x: 1. copy x on the sec

Claim Under the assumptions above, if there is an algorithm for checking a problem then there is an algorithm for solving the problem. Before going on, you should think a bit about

While the SL 2 languages include some surprisingly complex languages, the strictly 2-local automata are, nevertheless, quite limited. In a strong sense, they are almost memoryless

The fundamental idea of strictly local languages is that they are speci?ed solely in terms of the blocks of consecutive symbols that occur in a word. We'll start by considering lan

1. An integer is said to be a “continuous factored” if it can be expresses as a product of two or more continuous integers greater than 1. Example of continuous factored integers

We'll close our consideration of regular languages by looking at whether (certain) problems about regular languages are algorithmically decidable.