Computational and Complexity Theory

Explore the Rice theorem and its implications for undecidability by examining the halting problem, Turing machines, and Turing recognizable languages, including variants like multi-tape and multi-track machines.

Explore Rice theorem implications for nontrivial properties of recursively enumerable languages, showing that a universal Turing machine cannot decide such properties, highlighting undecidability.

Explore examples of Rice's theorem by examining nontrivial properties of languages recognized by Turing machines, including regularity, pushdown automata, and undecidability.

State Rice's theorem: any non-trivial property of recursively enumerable languages is undecidable. Differentiate trivial properties from non-trivial ones and illustrate reductions from HP to demonstrate undecidability.

Introduce the post correspondence problem (PCP) and ground it in rice theorem, detailing trivial and non-trivial properties and the undecidable nature of such decision problems.

Explore the post correspondence problem by testing sequences for matching output strings, using M1, M2, M3 and permutations to illustrate potential solutions.

Explore the post correspondence problem (pcp) with model examples, demonstrating solvable and unsolvable instances by matching sequences from two lists of strings, using w_i and x_i, with repetition allowed.

Explains the post correspondence problem and the modified version, highlighting the first pair requirement and how w_i and x_i sequences must generate equal strings to solve the instance.

Explore reducing MPCP to PCP by inserting a star symbol into A and B to force the first pair, with start and dollar markers guiding alignment.

Demonstrates reducing a universal Turing machine problem to Mpcp by encoding M and W into lists a and b; a solution exists exactly when M accepts W.

Illustrates how reductions relate PCP language and PCP problem, and why some instances are undesirable. Defines recursively enumerable languages as those accepted by Turing machines, linked to type zero grammars.

Explore the closure properties of recursive languages, including union, concatenation, intersection, and complement, and see how these operations keep languages recursive.

Introduce computational complexity and complexity theory, analyzing time and space requirements of algorithms; compare how program performance models and classifies problems that can be solved by a computer.

Learn how space complexity measures the storage a Turing machine needs, based on the number of cells visited on input word W, and how it relates to time complexity.

Explore key complexity classes, including P, NP, and NP-complete, and contrast polynomial and non-deterministic polynomial time with exponential versus linear growth.

Compare polynomial and exponential algorithms with examples like linear and binary search versus traveling salesman and subset sum. Explain the framework linking P and NP-complete problems.

Review the concepts of NP and P problems, and distinguish deterministic from nondeterministic polynomial time. Explain reduction in polynomial time and illustrate with an area of square versus perimeter example.

Explore reductions between nondeterministic polynomial-time problems, distinguish NP, NP-hard, and NP-complete classes, and examine satisfiability as a base problem defined by assigning values to variables to satisfy a boolean formula.

Explore how satisfiability relates to NP-hard and NP-complete problems via reductions and Cook's theorem, and compare deterministic and nondeterministic polynomial time with vertex cover as an NP-complete example.