Complexity and Computability

Title

Complexity and computability constitute a fundamental branch of information physics oriented to the study of the formal limits of calculation and the resources necessary to solve problems.
Its foundation lies in the classification of algorithms according to time, memory and structure, as well as the distinction between treatable, intractable or undecidable problems.
In addition, this discipline deals with the analysis of automata, algorithmic complexity and system simulation, which makes it possible to understand deep constraints in science and technology.

ID:263