Tarski-Kuratowski algorithm

English

Etymology

Named after Alfred Tarski and Kazimierz Kuratowski.

Proper noun

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.
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.