Investigations in the Theory of Descriptive Complexity (Classic Reprint) - Softcover

Inhaltsangabe

Dive into descriptive complexity and discover how randomness, optimal programs, and subrecursive ideas shape this branch of theory. This work presents foundational concepts and key results in a rigorous, approachable way.

The book surveys several formulations of descriptive complexity, explains how different definitions relate, and shows what these differences mean for infinite and finite strings. It uses clear, structured chapters to compare absolute and conditional complexity, introduce subrecursive approaches, and discuss the behavior of universal computers and optimal programs. Readers will see how ideas about randomness, immunity, and complexity interact across formulations.

• Learn how descriptive complexity is defined for binary strings and how randomness is characterized in this framework.


• Explore the concept of optimal programs and why their behavior differs across formulations.


• See how the theory extends to subrecursive formalisms and what that implies for limits of computation.


• Understand key proofs and the logical structure behind results about immune sets and universal computers.

Ideal for readers of theoretical computer science and mathematical logic seeking a rigorous treatment of descriptive complexity and its foundational questions.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.