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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

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

Origin

Named after Alfred Tarski and Kazimierz Kuratowski.

Full word history & related roots →
Cite this entry
APA

Tarski-Kuratowski algorithm. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Tarski-Kuratowski%20algorithm

MLA

“Tarski-Kuratowski algorithm.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Tarski-Kuratowski%20algorithm. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Tarski-Kuratowski algorithm,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Tarski-Kuratowski%20algorithm.

Source: Tarski-Kuratowski algorithm on Wiktionary, CC BY-SA 4.0.