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
how to convert a grammar into GNF

what exactly is this and how is it implemented and how to prove its correctness, completeness...

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

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

what problems are tackled under numerical integration

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

The objective of the remainder of this assignment is to get you thinking about the problem of recognizing strings given various restrictions to your model of computation. We will w

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

This close relationship between the SL2 languages and the recognizable languages lets us use some of what we know about SL 2 to discover properties of the recognizable languages.

Generate 100 random numbers with the exponential distribution lambda=5.0.What is the probability that the largest of them is less than 1.0?