Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Tarski–Kuratowski algorithm

Known as: Tarski-Kuratowski algorithm 
In computability theory and mathematical logic the Tarski–Kuratowski algorithm is a non-deterministic algorithm which provides an upper bound for the… Expand
Wikipedia

Related topics

Related topics

8 relations
Analytical hierarchyArithmetical hierarchyExistential quantificationList of algorithms
Expand

Broader (2)

Computability theoryTheory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
1982
1982
A characterization of the uniform closure of the set of homeomorphisms of a compact totally disconnected metric space into itself
The limit index X(x) of a point x in a compact metric space is defined. (Roughly: Isolated points have index 0, limit points have… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE