Jump to content

Tarski–Kuratowski algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by NekoDaemon (talk | contribs) at 19:38, 25 November 2005 (Nyaa! Categoryredirect: Category:Computability -> Category:Theory of computation). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

The algorithm is named after Alfred Tarski and Kazimierz Kuratowski.

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=29230162"