: Understand Finite State Machines and Context-Free Grammars.
: Problems where a solution can be verified in polynomial time. EXP : Problems requiring exponential time. Space Complexity Classes : L / NL : Logarithmic space (very restrictive).
This section asks:
: The machine halts on "Yes" but may loop on "No."
: Defining complexity classes based on language restrictions rather than machine bounds. Computability and Complexity Theory, 2nd Edition
This section asks: Models of Computation :
There is no program that can determine if another program will run forever. : Recursive : The machine always halts with a "Yes" or "No." : Understand Finite State Machines and Context-Free Grammars
: The process of transforming one problem into another to prove difficulty.
: Understand Finite State Machines and Context-Free Grammars.
: Problems where a solution can be verified in polynomial time. EXP : Problems requiring exponential time. Space Complexity Classes : L / NL : Logarithmic space (very restrictive).
This section asks:
: The machine halts on "Yes" but may loop on "No."
: Defining complexity classes based on language restrictions rather than machine bounds.
This section asks: Models of Computation :
There is no program that can determine if another program will run forever. : Recursive : The machine always halts with a "Yes" or "No."
: The process of transforming one problem into another to prove difficulty.