Implicit computational complexity

Implicit computational complexity (ICC) is a subfield of computational complexity theory that characterizes algorithms by constraints on the way in which they are constructed, without reference to a specific underlying machine model or to explicit bounds on computational resources unlike conventional complexity theory. ICC was developed in the 1990s and employs the techniques of proof theory, substructural logic, model theory and recursion theory to prove bounds on the expressive power of high-level formal languages. ICC is also concerned with the practical realization of functional programming languages, language tools and type theory that can control the resource usage of programs in a formally verifiable sense.

This article does not cite any external source. HandWiki requires at least one external source. See citing external sources. Please help improve this article. Unsourced material may be removed in future.
Find sources: "Implicit computational complexity" – news · newspapers · books · scholar · JSTOR (2021) (Learn how and when to remove this template message)

|

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/ Implicit computational complexity. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Implicit_computational_complexity&oldid=1785276"