Tarski–Kuratowski algorithm
From Wikipedia, the free encyclopedia
In computability theory and mathematical logic the Tarski–Kuratowski algorithm is a non-deterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy.
The algorithm is named after Alfred Tarski and Kazimierz Kuratowski.