List of computability and complexity topics
id:
list-of-computability-and-complexity-topics-280-1740870
title:
List of computability and complexity topics
text:
This is a list of computability and complexity topics, by Wikipedia page. Computability theory is the part of the theory of computation that deals with what can be computed, in principle. Computational complexity theory deals with how hard computations are, in quantitative terms, both with upper bounds, and from below. For more abstract foundational matters, see the list of mathematical logic topics. See also list of algorithms, list of algorithm general topics.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/List_of_computability_and_complexity_topics
date created:
date modified:
2024-04-18T23:04:13Z
main entity:
{"identifier":"Q6613099","url":"https://www.wikidata.org/entity/Q6613099"}
image:
fields total:
13
integrity:
13