Jump to content

Tarski–Kuratowski algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by CBM (talk | contribs) at 19:25, 6 December 2006 (Add reference, slight cleanup). 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 formulas in the arithmetical hierarchy.

The algorithm is named after Alfred Tarski and Kazimierz Kuratowski.

References

  • Rogers, H. The Theory of Recursive Functions and Effective Computability, MIT Press. ISBN 0-262-68052-1; ISBN 0-07-053522-1


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