Advanced
Theory of Computation
Q86 / 100
What is descriptive complexity theory?
Correct! Well done.
Incorrect.
The correct answer is B) Characterizing complexity classes by the logical languages that define them (e.g., P = FO + LFP on ordered structures)
B
Correct Answer
Characterizing complexity classes by the logical languages that define them (e.g., P = FO + LFP on ordered structures)
Explanation
Descriptive complexity (Fagin, Immerman) connects logic and complexity: NP = ∃SO (existential second-order logic), P = FO+LFP on ordered structures, L = FO+DTC. This gives machine-independent characterizations.
Progress
86/100