Word.ws English Dictionary

Tarski-Kuratowski algorithm

Tarski-Kuratowski algorithm proper noun: a nondeterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy.

Proper noun

the Tarski-Kuratowski algorithm

  1. A nondeterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy.

Origin of Tarski-Kuratowski algorithm

Named after Alfred Tarski and Kazimierz Kuratowski.

Questions about Tarski-Kuratowski algorithm

What does Tarski-Kuratowski algorithm mean?
Tarski-Kuratowski algorithm means a nondeterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy.
What part of speech is Tarski-Kuratowski algorithm?
Tarski-Kuratowski algorithm is a proper noun.

Words near Tarski-Kuratowski algorithm in the dictionary

  1. tarsipedids
  2. tarsitis
  3. Tarskavaig
  4. Tarski
  5. Tarski's fixed-point theorem
  6. Tarski-Kuratowski algorithm
  7. Tarski-Seidenberg theorem
  8. Tarskian
  9. Tarskis
  10. Tarsle
  11. tarso-

Source and license

Adapted from Wiktionary: Tarski-Kuratowski algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Tarski-Kuratowski algorithm.” Word.ws, https://word.ws/tarski-kuratowski_algorithm. Based on Wiktionary, CC BY-SA 4.0.