Live data from Hacker News

Burning Ship Fractal

en.wikipedia.org

21–30 of 68 posts

Re: Burning Ship Fractal

#21
post #18
post #15

Earlier quoted context omitted.

"Where does all that 'entropy' come from?" Your scare quote suggests you may already know this, but for the benefit of others, the answer is that there isn't any. Fractals may look visually complicated, but their information content is fully captured by the routines used to generate them, which include the formula and the coloring system being used. This is one of the ways in which "information" is a highly counter-i…

Yes, that is what I mean. Why is there a disconnect between the complexity of the compact description and the naive description? Why are simple expressions not simple in all "natural" representations? This is not addressable with the contrived example of "you can create an encoding scheme that reduces an arbitrarily complex description to an arbitrarily short identifier". After all, this is not a constructed compress…

> Why are simple expressions not simple in all "natural" representations?

Another example might be the primes, which have a very simple description and very subtle structure in their distribution.

Re: Burning Ship Fractal

#22
post #20

Earlier quoted context omitted.

I'm sure they picked the point they're zooming in on intentionally, but I thought it was interesting when it started being radially symmetrical. I wonder how they chose the point; trial and error, or was there some mathematical way of guaranteeing that there is something "interesting" at that point?

Or they recorded it zooming out, and reversed the recording.

But they still had to find an interesting point from which to zoom out, right?

Re: Burning Ship Fractal

#23
post #19

Earlier quoted context omitted.

While "real" numbers are indeed weird, I don't think that's the real explanation here. There are lots of small programs with complex output that have nothing to do with real numbers. If someone gave you one of these programs without telling you what it was for, real numbers would at best be a useful abstraction (bear in mind that there are no actual "real numbers" here, only finite bit-strings). But it might turn out…

But computing machines aren't unpredictable. They are very predictable. They appear to pull complex structure out of the aether. Perhaps the interesting thing is that the set of n-bit programs expands to only 2^n possible outputs. Why are some finite number of infinite-length outputs accessible, but not others? Why does nature favor those sequences?

>But computing machines aren't unpredictable. They are very predictable.

Are they though? A 5-state Turing machine might seem trivial, but there exist programs in it, that we don't know if they ever halt or not [1]. Their behavior is totally non-deterministic for our understanding. There are also minimalistic cellular automata that produce completely unpredictable patterns. [2]

[1] https://en.wikipedia.org/wiki/Busy_beaver#Known_values_for_....

[2] https://en.wikipedia.org/wiki/Rule_110

Re: Burning Ship Fractal

#24
post #10

Fractals can be drawn by surprisingly small amounts of code. For example, this mandelbrot fractal is implemented in 122 characters of JavaScript: https://www.dwitter.net/d/123 I wouldn't be surprised if the burning ship fractal could be coded on dwitter (i.e. with 140 characters or less) as well

When working on an SoC over 5 years ago, we'd have it display the company logo on screen upon boot. While not necessary for the test, it was really useful to see if the system reached that boot stage.

As an afternoon exercise, I wrote a Mandelbrot draw function (my first fractal display code!). Then I realized it was both faster and used less code and runtime memory than the image display stuff, so I replaced it in my environment. Other people were amused by it, so it went in public repository.

A couple weeks later, someone removed it to reinstate the image display. I guess having the company logo for internal-only code was more important to someone :(

I don't work there anymore.

Re: Burning Ship Fractal

#25
post #10

Fractals can be drawn by surprisingly small amounts of code. For example, this mandelbrot fractal is implemented in 122 characters of JavaScript: https://www.dwitter.net/d/123 I wouldn't be surprised if the burning ship fractal could be coded on dwitter (i.e. with 140 characters or less) as well

Just need to add a Math.abs: https://www.dwitter.net/d/457

[deleted]

Re: Burning Ship Fractal

#26

7 minute zoom of the fractal. Incredible level of detail and that final mirrored inverted fractal at 6'38 took me by surprise. https://www.youtube.com/watch?v=CD9yNFmb2FE Are there any good fractal explorers in VR?

Not quite VR, but there exists someone's personal hobby 3D fractal viewer that has an absolutely bananas level of polish:

http://sub.blue/fractal-lab

I highly recommend taking the time to watch his video.

Re: Burning Ship Fractal

#27
post #18
post #15

Earlier quoted context omitted.

"Where does all that 'entropy' come from?" Your scare quote suggests you may already know this, but for the benefit of others, the answer is that there isn't any. Fractals may look visually complicated, but their information content is fully captured by the routines used to generate them, which include the formula and the coloring system being used. This is one of the ways in which "information" is a highly counter-i…

Yes, that is what I mean. Why is there a disconnect between the complexity of the compact description and the naive description? Why are simple expressions not simple in all "natural" representations? This is not addressable with the contrived example of "you can create an encoding scheme that reduces an arbitrarily complex description to an arbitrarily short identifier". After all, this is not a constructed compress…

> Why are simple expressions not simple in all "natural" representations?

I think because that simple description describes a non-linear iterative process that feeds back on itself.

Re: Burning Ship Fractal

#28
post #21
post #18

Earlier quoted context omitted.

Yes, that is what I mean. Why is there a disconnect between the complexity of the compact description and the naive description? Why are simple expressions not simple in all "natural" representations? This is not addressable with the contrived example of "you can create an encoding scheme that reduces an arbitrarily complex description to an arbitrarily short identifier". After all, this is not a constructed compress…

> Why are simple expressions not simple in all "natural" representations? Another example might be the primes, which have a very simple description and very subtle structure in their distribution.

I don't really agree that the primes “have a very simple definition” in that the notion of ‘primeness’ is one of satisfiability and no constructive algorithm is known to exist.

Re: Burning Ship Fractal

#29
post #23
post #19

Earlier quoted context omitted.

But computing machines aren't unpredictable. They are very predictable. They appear to pull complex structure out of the aether. Perhaps the interesting thing is that the set of n-bit programs expands to only 2^n possible outputs. Why are some finite number of infinite-length outputs accessible, but not others? Why does nature favor those sequences?

>But computing machines aren't unpredictable. They are very predictable. Are they though? A 5-state Turing machine might seem trivial, but there exist programs in it, that we don't know if they ever halt or not [1]. Their behavior is totally non-deterministic for our understanding. There are also minimalistic cellular automata that produce completely unpredictable patterns. [2] [1] https://en.wikipedia.org/wiki/Busy_…

See also the turing machines whose halting behavior is independent of ZFC. http://www.scottaaronson.com/blog/?p=2725
Post reply on HN