Skip to search form
Skip to main content
Semantic Scholar's Logo
Create Free Account
You are currently offline. Some features of the site may not work correctly.
In computability theory and mathematical logic the Tarski–Kuratowski algorithm is a non-deterministic algorithm which provides an upper bound for the…
List of algorithms
Theory of computation
Semantic Scholar uses AI to extract papers important to this topic.
A characterization of the uniform closure of the set of homeomorphisms of a compact totally disconnected metric space into itself
Frank B. Miles
Corpus ID: 123141333
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…
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Terms of Service
ACCEPT & CONTINUE