Tarski–Kuratowski algorithm
From Wikipedia, the free encyclopedia
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 and analytical hierarchy.
The algorithm is named after Alfred Tarski and Kazimierz Kuratowski.
[edit] References
- Rogers, H. The Theory of Recursive Functions and Effective Computability, MIT Press. ISBN 0-262-68052-1; ISBN 0-07-053522-1
 |
This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |
