hofstee

You’re practically describing Kim Jung Gi: https://youtu.be/MGbvhyTZXfs

They are talking about an art project from students at a dutch university and are misinformed. https://youtu.be/D1Thmz61sho

  data Exp = Num Int
           | Bool Bool
           | Var Var
           | If Exp Exp Exp
           | Lambda Var Exp
           | App Exp Exp

An Expression is either:

- a Number literal, with an Integer value

- a Boolean literal, with a Boolean value

- a Variable declaration, with some identifier

- an If expression (probably), with a condition, taken, and not-taken Expressions

- a Lambda, which substitutes a Variable into an Expression

- an Apply, which is how we chain Expressions and apply the results of one expression onto the next

  data Type = TyInt | TyBool | TyArrow Type Type

Our Types are TypeInt, TypeBool, or a Function (TyArrow) which goes from an input Type to an output Type

I can't even get WiFi working on my Pi 4. I can only resolve IPv6, anything IPv4 fails. I suspect it's a router issue but I have no control over that, so I simply can't use the Pi.

Other useful tools include mosh or EternalTerminal to handle either low bandwidth or spotty network when you need to remote into a server, as well as VNC for when you need a GUI on the server but X-forwarding is too slow.

I don't have images but I can easily play back a song in my head so I think I have sound.

If you're streaming in a language like Python, its IO will be doing some degree of chunking behind the scenes. It might be beneficial to do more manually.

Actually you can find similar versions here. http://csapp.cs.cmu.edu/3e/labs.html

Agree completely. I like my mouse. This doesn't work with a mouse because its design ideals say mice shouldn't exist. Hmm.

There is a sorting network called AKS which has O(log(n)) depth. Batcher's Odd-Even Mergesort has a depth of O(log^2(n)). Which is better?

In all cases where you can fit n in the total memory capacity of the earth, Batcher's network is vastly superior. Constants matter a whole lot more than you might think.

I'm not arguing against revising algorithms to look for better complexity classes, but if you rewrite your algorithm in a smaller complexity class you had better be sure that your constants are of reasonable size.

You absolutely can. The FFT is one cycle of a Discrete Fourier Transform, and since this data is both discrete and in regular intervals, it should behave identical to just sampling an audio signal.

The article assumes the use of a signed integer, by passing in values that can't be represented with a signed integer you can't assume the same solutions hold.

Yep. They cover this in intro CS classes at CMU to this day.

I remember seeing a chrome extension a while ago that I hoped would be like this, but instead was a plaintext list of guidines and reminders that didn't react to your site at all.

I feel like I've seen this video many years ago...

Hasn't this been on Greenlight for a while now?

Isn't this just bottom up DP?

Came here to say this. It's entertaining to watch everyone commenting burst into laughter as the screen fills with w's.

Lytro does something similar, but with light fields instead of depth maps. https://www.lytro.com/camera/

Is it possible to have it such that changing theme doesn't stop the audio? Also buffering issues result in the last tone being held until playback can continue, might be more pleasant if it were just silence.

Aside from that, looks fantastic!