Computability of Self-Similar Sets.
- Resource Type
- Article
- Authors
- Kamo, Hiroyasu; Kawamura, Kiko
- Source
- Mathematical Logic Quarterly. 1999, Vol. 45 Issue 1, p23-30. 8p.
- Subject
- *MATHEMATICAL models
*SELF-similar processes
*EUCLIDEAN algorithm
*SET theory
*COMPUTABLE functions
*RECURSIVE functions
- Language
- ISSN
- 0942-5616
The article presents a research paper which seeks possible mathematical tools that can examine a self-similar set on an Euclidean space from the viewpoint of computability. It states that a self-similar set forms from a nonempty compact set that is the solution of a set equation. Findings reveal that a self-similar set is a recursive compact set if all of the contractions are computable.