Computation theory Assignment Help
Download as PPTX, PDF0 likes42 views
The document discusses computation theory, defining computation as any information processing that can be represented as an algorithm. It introduces key concepts like algorithms, abstract machines, and Turing machines, emphasizing the limitations and boundaries of computation. The Turing machine model is highlighted as a foundational concept in understanding computation, including its components and operational conventions.
Computation theory Assignment Help
- 2. GLOBALWEBTUTORS.COM Computation is a general term for any type of information processing that can be represented as an algorithm precisely (mathematically). Examples: Adding two numbers in our brains, on a piece of paper or using a calculator. Converting a decimal number to its binary presentation or vise versa. GLOBALWEBTUTORS.COM
- 3. THEORY OF COMPUTATION GLOBALWEBTUTORS.COM A very fundamental and traditional branch of Theory of Computation seeks: A more tangible definition for the intuitive notion of algorithm which results in a more concrete definition for computation . Finding the boundaries (limitations) of computation. Email Assignments at Support@globalwebtutors.com Connect on the website chat anytime 24/7 GLOBALWEBTUTORS.COM
- 4. ALGORITHIM A finite sequence of simple instructions that is guaranteed to halt in a finite amount of time. This is a very abstract definition, since: We didn’t specify the nature of this simple instructions. For example an instruction can be “increment a number by one” or “Calculate the triple integral” We didn’t specify the entity which can execute these instructions. For example is this entity a person, a computer, … If it is a computer what is the processor type? How much memory does it have? …. ? GLOBALWEBTUTORS.COM
- 5. An Abstract Machine To make a more solid definition of algorithm we need to define an abstract (general) machine which can perform any algorithm that can be executed by any computer. Then, We need to show that indeed this machine can run any algorithm that can be executed by any other computer. Then, We can associate the notion of algorithm with this abstract machine. We can study this machine to find the limitations of computations. (Problems with no computation available to solve.) GLOBALWEBTUTORS.COM
- 6. TURING MACHINE ASSIGNMENT HELP GLOBALWEBTUTORS A conceptual model for general purpose computers proposed by Alan Turing in 1936. A Turing machine has an unlimited and unrestricted amount of memory. A Turing machine can do everything a real computer can do. Nevertheless there are problems that a Turing machine cannot solve. In a real sense, these problems are beyond the theoretical limits of computations. GLOBALWEBTUTORS.COM
- 7. Turing Machine Specification Components of Turing Machine: An unlimited length tape of discrete cells. A head which reads and writes on tape. A control device with a finite number of states which can Instruct the head to read the symbol on the tape currently under head. Instruct the head to write a symbol on the cell of the tape currently under tape. Move the head one cell to left or right. GLOBALWEBTUTORS.COM
- 8. A Turning Machine Instructions of Turing Machine have the following format: (Current State, Current Symbol, Write, Move L/R or No move, New State) Ex: (2, 0, 1, L, 3) (3, 1, blank, N, 4) (1, #, 0, R, 7) GLOBALWEBTUTORS.COM
- 9. TM Conventions We always use state 1 as the initial state. (That is the execution of the algorithm or program begins with stating of the TM being 1. The tape is used for recording input and output, one symbol per cell. Initially, the string to serve as input to our computation is recorded beginning from the leftmost tape cell. Initially, the position of head is at left most cell. Initially, the position of head is at left most cell GLOBALWEBTUTORS.COM
- 10. The Output of TM The output of a TM program or algorithm is the sequence of symbols on the tape when the TM halts on that program. GLOBALWEBTUTORS.COM