Braverman, Mark
Computability of Julia Sets
Table of contents
1. Introduction to Computability
2. Dynamics of Rational Mappings
3. First Examples
4. Positive Results
5. Negative Results
6. Computability versus Topological Properties of Julia Sets
Nyckelord: Mathematics, Algorithms, Theory of Computation, Algorithm Analysis and Problem Complexity, Mathematics of Computing, Algebra
- Författare
- Braverman, Mark
- Yampolsky, Michael
- Utgivare
- Springer
- Utgivningsår
- 2009
- Språk
- en
- Utgåva
- 1
- Serie
- Algorithms and Computation in Mathematics
- Sidantal
- 164 sidor
- Kategori
- Naturvetenskaper
- Format
- E-bok
- eISBN (PDF)
- 9783540685470
