Jump to content

Tarski–Kuratowski algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by MathMartin (talk | contribs) at 12:23, 25 September 2005 (Initial stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In computability theory and mathematical logic the Tarski-Kuratowski algorithm is a non-deterministic algorithm which provides an upper bound for the complexity of arithmetic formulas.

Stub icon

This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Tarski–Kuratowski_algorithm&oldid=23990423"