Computational Complexity and Computability
Summary
Computability theory establishes which problems can in principle be solved by mechanical procedures, formalised by the Turing machine model and its equivalents. It draws a firm boundary between decidable problems—where an algorithm halts on every input—and undecidable ones such as the halting problem. Beyond mere solvability, computational complexity examines the resources required by such algorithms. Central complexity classes include P (polynomial‐time), capturing tractable problems; NP, the class of problems verifiable in polynomial time; and NP‐hard, encompassing challenges believed to resist efficient algorithms. The pivotal P versus NP question asks whether every problem whose solution can be checked rapidly can also be solved rapidly. Complexity theory further refines this landscape through non‐deterministic, probabilistic and quantum models, and through parameterised complexity, which seeks efficient algorithms when certain parameters remain small. Alongside time and space measures, modern research explores communication complexity, proof complexity and algebraic methods to understand fundamental limits on computation.
Research from Nature Portfolio
No recent Nature Portfolio content available.
Computational Complexity and Computability publication trend
The graph below shows the total number of articles in computational complexity and computability across all publications each year (not limited to Nature Index journals).
Technical terms
Turing machine: Abstract automaton with an infinite tape and finite control that models step‐by‐step algorithmic computation.
Decidable: A problem is decidable if there exists an algorithm that halts on every input and correctly accepts or rejects.
NP‐hard: A class of decision problems at least as hard as the hardest problems in NP; no polynomial‐time algorithms are known.
Polynomial calculus degree: The maximum degree of polynomials needed in algebraic proofs of unsatisfiability, linked to proof size.
Blocky rank: The minimum number of block‐structured permutation‐matrix blowups required to span a Boolean matrix, used to derive communication lower bounds.
Parameterized complexity: Framework analysing how computational effort scales with input size and one or more chosen parameters, identifying fixed‐parameter tractable cases.
References
- On Blocky Ranks Of Matrices. computational complexity (2024).
- A survey of parameterized algorithms and the complexity of edge modification. Computer Science Review (2023).
About these summaries
This Nature Research Intelligence Topic summary is created with the cited references and a large language model. We take care to ground generated text with facts, and have systems in place to gain human feedback on the overall quality of the process in line with our AI principles. We strive to create accurate and useful summaries for people unfamiliar with the research topic and that supports this goal. These pages are a beta release and will be updated as we learn how best to help people gain value from a research topic summary.
Turn complex research questions into confident strategic decisions
When you're under pressure to set direction, justify investment, or understand your competitive position, you need more than raw data — you need trusted insights you can act on.
Benchmark your performance against global peers using robust, methodologically sound analysis.
Combine quantitative metrics with qualitative expert insight to uncover strengths, gaps and emerging opportunities.
Gain tailored, decision-ready recommendations aligned to your strategic priorities.
Talk to us to learn more about our data dashboards and bespoke strategy reports.
Grow research skills, confidence and careers with training built for every stage of the research lifecycle.
Developed with Nature Portfolio journal Editors and internationally renowned experts. Discover three ways to learn:
Self-paced, online courses in convenient bite-sized units, covering key skills across scientific writing, publishing, grant writing, data analysis, and more.
Expert trainer-led workshops with hands-on exercises and real-time feedback across core research skills, delivered via interactive group sessions.
Editor-led workshops combining core principles in writing and publishing, personalised 1:1 feedback from Nature Portfolio Editors and hands-on exercises.
Explore course catalogues and workshop agendas, enquire about the options or request institutional pricing.