Skip to search form
Skip to main content
Semantic Scholar
All Fields
All Fields
Art
Biology
Business
Computer Science
Chemistry
Economics
Engineering
Environmental Science
Geography
Geology
History
Materials Science
Mathematics
Medicine
Philosophy
Physics
Political Science
Psychology
Sociology
FAQ
Contact Us
•
Sign In
Create Free Account
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
Watch Topic
Related topics
Related topics
8 relations
Analytical hierarchy
Arithmetical hierarchy
Existential quantification
List of algorithms
Expand
Broader (2)
Computability theory
Theory 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
Frank B. Miles
1982
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
Is this relevant?
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