Bytebeat: Music from very short programs - the 3rd iteration

What people said

isoprophlex · 2024-03 · Recommendation

See also the 1D version of this, rendered as audio: "bytebeat" music. Surprisingly complex music from very simple modular arithmetic and bit shifting. [VIDEO]

Read the original HN comment ↗

DonHopkins · 2020-04 · Reference

Listening to a PDP-7 with an AM radio isn't exactly ByteBeat (since you're technically only allowed one line of code), but it sure sounds a lot like it: Meet Bytebeat: A Brand New Electronic Music Genre [LINK] >Become a slave to the algorhythm. >Heard about the latest computer music genre sweeping the internet? It’s called “bytebeat” and if this comes as news to you, don’t despair, the thing’s only about five months old, so you’re still ahead of the curve. Bytebeat is algorithmic music created from one line of code and was discovered/invented while Finnish low-tech artist and programmer Ville-Matias Heikkila (aka Viznut) and his friends were experimenting with the computer programming language C code and creating one line formulas that could produce an audio output (see below). Bytebeat: Music from very short programs - the 3rd iteration [VIDEO] Bytebeat - Music from math formulas [LINK]

Read the original HN comment ↗

vanderZwan · 2017-02 · Reference

> Points near the origin have dark colors, with the color assigned to a complex number z approaching black as z approaches 0. Points far from the origin are light, with the color of z approaching white as |z| approaches infinity. Every complex number has a different color in this picture, so a complex number can be uniquely specified by giving its color. So I was wondering if this approach could also be useful in the context of floats and integers. The implementation becomes simpler in many ways (we only have a finite number of possible values to consider). For example, start with a unique mapping of 8-bit integers to a continuous colour ramp. I suppose the easiest option would be to start in the top left, then go from left to right, top to bottom, resulting in a 16x16 image. If we then take a formula that also returns an 8-bit value, map every possible input to an output, and show the results as an image, it should make it easy to see where we have an integer overflow, for example (if we see sudden jumps from very bright to dark or the other way around). Then I realised: I have seen this in the wild! It's used all over the place in the demo-scene. For example: [VIDEO] [LINK] Aside, this also reminds me of Gustafson's closure plots for comparing his number encoding to standard floating points, although it's not really the same thing: [LINK]

Read the original HN comment ↗