1. Blum L, Shub M, Smale S (1989) On a theory of computation and complexity over the real numbers: NP-completeness, recursive-functions, and universal machines. Bull Amer Math Soc 21(1989):1–46
2. Hopcroft J, Ullman J (1979) Introduction to automata theory, languages, and computation. Addison-Wesley Publishing Company
3. Jacobson N (1985) Abstract algebra. Dover Publication
4. Kearfott RB. Interval computations: introduction, uses, and resources. https://interval.louisiana.edu/preprints/survey.pdf
5. Kelley J (1955) General topology. Van Nostrand. Ch 3, Theorem 1, Item e