Tarski-Kuratowski algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:
Wikipedia

Etymology[edit]

Named after Alfred Tarski and Kazimierz Kuratowski.

Proper noun[edit]

the Tarski-Kuratowski algorithm

  1. (computing theory) A nondeterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy.
Retrieved from "https://en.wiktionary.org/w/index.php?title=Tarski-Kuratowski_algorithm&oldid=77969749"