Scribd
Upload
8 views6 pages

Summary Theory

The document discusses theoretical models of computation including Post Machines and Turing Machines. It covers topics like determinism, non-determinism, computability, complexity classes, and intractable problems.

Uploaded by

fakemail233237
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views6 pages

Summary Theory

The document discusses theoretical models of computation including Post Machines and Turing Machines. It covers topics like determinism, non-determinism, computability, complexity classes, and intractable problems.

Uploaded by

fakemail233237
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Chapter 7: Post Machines

What are Post Machines?


 Answer: Post Machines are theoretical models used to study the limits of algorithmic
processes.

What is a Deterministic Post Machine (DPM)?


 Answer: A DPM has predefined rules where each input results in one specific output or
state transition, making its operations predictable.

How does a Deterministic Post Machine function?


 Answer: It follows a linear sequence of operations based on given instructions.

What is the language of a Post Machine?


 Answer: The set of all strings that a Post Machine can recognize or accept.

What is a Non-Deterministic Post Machine (NPM)?


 Answer: An NPM can transition to multiple states from the same input, exploring several
computational paths simultaneously.

Why are Non-Deterministic Post Machines considered powerful?


 Answer: Because they can handle multiple possibilities at once.

How is the power of Post Machines compared to other models?


 Answer: They are compared with models like Turing Machines to understand their
strengths and limitations.
Chapter 9: Computability and
Undecidability

What is undecidability?
 Answer: It refers to problems for which no algorithm can determine the answer for all
possible inputs.

What is an example of an undecidable problem?


 Answer: The Halting Problem, which asks if a given program will halt or run indefinitely.

What is a recursively enumerable problem?


 Answer: A problem where a Turing Machine can list all valid solutions, even if it can't
decide for every input.

What is an example of a recursively enumerable but undecidable problem?


 Answer: Problems that can be recognized but not necessarily solved by a Turing
Machine.

What is the Post Correspondence Problem (PCP)?


 Answer: An undecidable problem involving a set of dominos with strings on both halves,
finding a matching sequence on both sides.

What are intractable problems?


 Answer: Problems with no efficient (polynomial-time) solution.

What is the significance of intractable problems?


 Answer: They include complex combinatorial problems and optimization tasks that can't
be solved quickly.
What is the Church-Turing Thesis?
 Answer: It suggests that any computation that can be performed algorithmically can also
be performed by a Turing Machine.

How are algorithms analyzed using asymptotic notations?


 Answer: Using Big O (O), Omega (Ω), and Theta (Θ) notations to describe algorithm
efficiency.

What are complexity classes like P and NP?


 Answer: P class problems can be solved in polynomial time by deterministic machines;
NP class problems can be verified in polynomial time by non-deterministic machines.

What are NP-complete problems?


 Answer: The hardest problems in NP, where solving one in polynomial time means all NP
problems can be solved in polynomial time.

Can you give examples of NP-complete problems?


 Answer: Satisfiability Problem, Vertex Cover Problem.
Chapter 10: Complexity Theory –
Advanced

What are common problem-solving strategies in algorithmic computing?


 Answer: Techniques like divide and conquer, backtracking, branch and bound, dynamic
programming, and greedy approaches.

What are approximation algorithms?


 Answer: Algorithms that find near-optimal solutions to optimization problems where
exact solutions are impractical.

Can you give an example of an approximation algorithm?


 Answer: Solving the Traveling Salesman Problem approximately.

What are randomized algorithms?


 Answer: Algorithms that use random numbers to make decisions, often leading to simpler
and faster solutions.

What are probabilistic algorithms?


 Answer: Algorithms that involve probabilistic analysis to guarantee performance with
high probability.

What are parallel algorithms?


 Answer: Algorithms that split a task into sub-tasks processed simultaneously on multiple
processors, speeding up computation.
What are theoretical models for parallel algorithms?
 Answer: Models like PRAM (Parallel Random Access Machine) are used to design and
analyze parallel algorithms.

Chapter 8: Turing Machines


What are Turing Machines?
 Answer: Abstract computational models with an infinite tape, read/write head, and state
rules.

What is the significance of Turing Machines?


 Answer: They form the foundation of computational theory, defining what can be
computed.

What are the main components of a Turing Machine?


 Answer: Tape, head, states, and transition function.

How does a Turing Machine operate?


 Answer: Reads tape, follows rules to change state, writes symbols, moves head, repeats.

What is Turing's Theorem?


 Answer: A universal Turing Machine can simulate any other Turing Machine.

What is the Turing Test?


 Answer: A test to see if a machine's behavior is indistinguishable from a human's.
What is the Church-Turing Thesis?
 Answer: Any mechanical computation can be performed by a Turing Machine.

What is the importance of the tape in a Turing Machine?


 Answer: The tape serves as memory for input, output, and computations.

What are the states and transitions in a Turing Machine?


 Answer: States are conditions during computation; transitions are actions based on state
and symbol.

What happens when a Turing Machine halts?


 Answer: The machine stops; input is accepted if in a final state, rejected otherwise.

What is an example of a Turing Machine computation?


 Answer: Performing addition by manipulating symbols on the tape until it halts with the
result.

What are P and NP complexity classes?


Answer:
 P Class: Solvable in polynomial time by deterministic machines.
 NP Class: Verifiable in polynomial time by non-deterministic machines.
 NP-Complete: Hardest problems in NP; solving one means all NP problems can be
solved in polynomial time.
How are functions computed using Turing Machines?
 Answer: A function is computable if a Turing Machine halts with the correct output for
any valid input.

What are some examples of computable functions with Turing Machines?


 Answer: Addition and comparison of integers through defined state transitions and tape
manipulations.

You might also like