Tarski-Kuratowski algorithm
English
editEtymology
editNamed after Alfred Tarski and Kazimierz Kuratowski.
Proper noun
editthe Tarski-Kuratowski algorithm
- (computing theory) A nondeterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy.