asynchrony

That's a very real danger. As much as I can side with the desire to have a human in the loop to observe the system, I'm not sure I trust any particular human to be free of bias or immune to emotional reactions that result in incorrect intuitions.

I was thinking more of high-functioning socio paths than people who have lost some mental capacity. I appreciate the benefit of your experience on the topic.

I suspect that in at least some cases when the actual perpetrator discovers that law enforcement has focused in on the incorrect suspect and is expending great resources to prove that suspect's guilt, they simply take their get out jail free card and move on. I have no background in psychology, but I'm confident that statistics will support that even the most deranged actors will be able to suppress their antisocial impulses to take advantage of such opportunities. Personally, I would rather have a statistical algorithm prioritize suspects than a human detective with a feeling (and the influence to set an entire law enforcement agency after a weak suspect).

The readme mentions that windows are draggable by holding alt.

Can you add a link to the instructions?

Copying the fingers is the most common operation. Every cons/decons requires copying one of the fingers. Operations that propagate deeper into the tree are lazy, so the primary factor affecting performance of common operations is time required to copy one of the fingers. The result of using a higher branching factor would be copying a larger memory block many times.

My understanding is that 4 is a relatively sweet spot for allowing efficient consing/deconsing of the finger nodes. I became fascinated by fingertrees a few years ago and created several toy implementations. I recall that the size of the fingers did impact the performance of various operations though I no longer remember.

Sadly I do recall that the constant factors were prohibitively high which made finger trees rather unsuited as an every day list/array data structure for most applications. It would certainly simplify programming to have one sequential collection type that is adequately performant at everything.

In Javascript (contents !== null && contents !== undefined) is equivalent to (contents != null).

Where are you getting this material advantage / ELO handicap ratio?

At any rate I'm also a decent amateur (2350 ELO) and it's absolutely unsurprising that a (2200+) player easily beats very strong computers with bishop odds.

Two bishops is still too much.

An above average amateur chess player around ELO 2000 should regularly beat the world champion with two extra bishops.

The majority of the games that you listed for console are also available for PC (on Steam).

Javascript strings are immutable and literals are almost certainly preallocated and stored in a table of constants. Why should using a string keys cause heap allocations?

Could you provide an example of a calculation that is more naturally expressed with concurrency?

Perhaps we should first establish the precise benefits of individual consciousness.

Hygienic macros prevent accidental symbol capture. They don't prevent intentional symbol capture. You may be thinking of the limitations of pattern based macros, but many Scheme systems provide hygienic procedural macros.

Some people would argue that once you remove the JVM there isn't much there (that can't be found elsewhere).

Except that ClojureScript is dependent on JVM Clojure, and if ClojureCLR were to take advantage of the CLR's capabilities (TCO and stack allocation, for example) it also wouldn't be Clojure.

So we're really talking about dialects of Clojure (and perhaps might as well be talking about dialects of Lisp in general).

Clojure is so closely tied to the JVM that it's hard to imagine it being the "100 year language" unless the JVM turns out to be the "100 year platform".

I don't quite understand this distinction between liveness and hotswapping, as all the examples of liveness that I've seen involve hotswapping code that causes graphic or audio side effects, and clearly that sort of thing has very real practical limitations.

I wonder if 4 comments to Godwin is a new record for Hacker News.

So you're saying that 042-68-4425 belongs to Jean Paul Ludwig, and Harrison J Bounel, and Obama.

And despite how trivial it would be to verify all of this, he's been elected president twice?

I have to call bullshit.

He's obviously a reptilian.

Am I the only who really dislikes the use of the word "binary" to simply mean "executable"?

In particular, calling an executable js file a "binary script" just seems wrong.

Class declarations will be equivalent (can be desugared to) a function declaration and some manipulations of the function's prototype. JS VMs already optimize this pattern, so why should syntax sugar for classes be anything special for the compiler?

The system will just spontaneously update to the next power-of-two bits when address space gets short. Problem solved.

Recursion depth limit is really a memory limit, so you just need someone to come and install more RAM when you run out in order to obtain de facto infinite memory, hence infinite recursion depth.

Translators and interpreters are still used in a fairly wide range of situations. I've worked both as a document translator and as a spoken interpreter in a number of manufacturing plants.

After watching this video, I'm fairly confident that a large part of the interpreting that I did could already be handled by this technology.

Consider a balanced tree that only exposes an immutable interface but uses destructive updates internally when rebalancing. In principle it would be immutable, though it wouldn't necessarily be threadsafe without additional work.

Have they ever explained why Pi is the ratio of a circle's circumference to its diameter?

Coffeescript doesn't add pattern matching.

In my opinion, up to a very, very high level, the importance of opening knowledge is vastly overrated.

The two highest rated players in the world (Carlsen and Aronian, neither of them participating in this world championship match) frequently just aim to get a playable position out of the opening and still succeed in outplaying very strong opposition in the late middlegame/endgame. This despite the fact that it would difficult to find two better examples of "human chess databases".