Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02116560n
Noun Concept
FR
No term available
EN
In computability theory and mathematical logic the Tarski–Kuratowski algorithm is a non-deterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy. Wikipedia
Relations
Sources
IS A
algorithme

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License