Timeline for Complexity of the Mandelbrot set on rationals
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 15, 2017 at 22:31 | comment | added | Joe Silverman | @coudy Oops, typo! Somehow it's easier to type perper than it is to type preper. | |
| Nov 15, 2017 at 20:29 | comment | added | coudy | @Silverman perperiodic? I guess you mean preperiodic? | |
| Oct 12, 2017 at 14:34 | comment | added | Phylliida | True, but might you be able to use the fact that all you need to know is if the norm squared of z is less than or equal to 4 to get around having to actually represent all 2^k bits? (k is the number of iterations and n is the number of bits in the rationals in the problem as posed but I see what you mean) | |
| Oct 12, 2017 at 14:29 | history | answered | Joe Silverman | CC BY-SA 3.0 |