knz42

This matrix uses period-sensitive knowledge as milestones and is esentially focused on knowledge (how much one knows) as opposed to proficiency in the programming activities.

I found it more useful to evaluate competency based on activities instead of particular data structures / algorithms / languages: http://science.raphael.poss.name/programming-levels.html

What about the `seek` argument which skips over some blocks at the beginning but still allocates them (unix "holes")?

Also note that there are still unix systems out there which do not support byte-level granularity of access to block devices. On those devices you must actually use a buffer of exactly the size of the blocks on the device. Heck, linux was like this until at least v2.

There's also https://www.levenez.com/unix/

yes.

I think the challenge is to find a way to tranform the name so that it's still legible by a human.

Like transform "Mister" to "Mr"

I found it interesting, so here's your data point.

Do you plan to make it work with CockroachDB?

It's a combination of bandwidth and latency. Latency in particular feels slow; you need to copy the new binary on every node, then issue commands over ssh to scrub any previous leftover files, initialize a cluster, run the tests, stop the cluster, retrieve the log files. Doing all this over the network is just taking a few more seconds which makes running hundreds of tests much longer than they would locally.

My guess is that the discussion being referred to is this one: https://groups.google.com/d/topic/cockroach-db/7w463Bv-Mbk/d...

Not sure where the vitriol is coming from though.

To be fair, once you have self-healing clusters having a node disappear / crash is not a big deal for availability of the entire cluster.

Also the blog post says nothing about integrity. It does not seem that integrity is affected.

It actually works already :)

(more does not page if its stdout is not a terminal)

Well of course we can do the second. It has happened all the way with the element table in chemistry. Heck we're even manufacturing non-natural matter (as in, probably never generated elsewhere in the universe) to fill the holes that the theory has created.

The Higgs boson also comes to mind.

Your thought experiment clearly implies energy is spent moving the wormhole. That would be the energy needed to spend to move your example rock.

So now thanks to this there are two implementations of AES in the linux kernel. Who's responsible for ensuring they are both correct?

You should use use '&&' instead of ';' so that you don't end up running another program should the compilation fail.

Also highly recommended to use '_$$' instead of plain '_'.

Yeah you can but to do that you need to match the academic prerequisites. You can enter 42 whatever your background is.

When transactions conflict, the priority of the losing transaction is internally ratcheted up. At some point it's just higher than everything after it and it succeeeds.

SQL is not a single language but rather a family of languages. Each RDBMS that advertises support for SQL ends up implementing a different flavor of SQL, most of the times they are not even compatible :)

For now CockroachDB's supports a subset of the SQL implemented by other databases, with some extensions of its own. This subset will grow over time.

The two levels of isolation offered are snapshot (SI) and serializable (SSI). Snapshot means that concurrent transactions are atomic with regards to each other and "see" the same initial state from the DB. Serializable adds into this that they can't introduce write skews, ie if there are concurrent transactions they will "see" each others effects in some order.

This was discussed earlier on the same blog: https://www.cockroachlabs.com/blog/living-without-atomic-clo...

Short answer: the DB will check for drifts and correct small drifts automatically.

Re: the consulting dollars. Obviously, this blog post had not published without prior contact with Aphyr.

Wealth is generated by the employees. The founders channel that wealth to them.

The challenge with being a founder is to find the right business plan at the moment then hire and maintain the right team to achieve it. It's a challenge indeed but this challenge does not deserve nor does it morally justify taking most of the wealth generated by the employees away from them.

The algorithm accesses each element in the input only once, and in order.

It's like reading a big file. Just call read() repeatedly, and discard old data each time you call read() again.

The post is called "Rust for functional programmers" and contains side-by-side comparisons with both OCaml and Haskell. http://science.raphael.poss.name/rust-for-functional-program... you might be confusing it with the other post "Haskell for OCaml programmers"?

It is a bit outdated but as far as I can see not inaccurate yet. I only plan to update it when HKTs make it to Rust.

The article could have been enhanced by highlighting that some shells (e.g. zsh) provide expansion patterns that recurse into subdirectories. e.g.

   ls **/*.txt

The point being you can't, due to the finiteness of c's abstract memory model, both for the heap (the tape) and stack (state transition graph)

You're making a categorical error here. The entire discussion is not about storing programs but about entering them. If you want to use a database for storage then the UI you present to populate your database will become syntax.

The idea that you can have multiple syntaxes for the same language is not new (eg multilingual pascal or basic) heck even different semantic models are possible (eg LLVM) but any UI that enables a programmer to tell a computer what to do is ultimately syntax.

I am a PL researcher and I too believe you may not fully understand what's going on.

To keep your analogy, the idea that a PL needs syntax to be used is comparable to the idea that a vehicle needs acceleration to get moving. Different flavors of syntax correspond to different means of propulsion.

Perhaps we will find good way to get rid of context free grammars (the horses in your example) and replace them with automatic pruning of parse forests (the current Tesla car of compilers) or even something more fancy like semantic editors (a fusion engine in your example) but unless you change the laws of physics, you can't get a vehicle without an accelerating engine nor a PL without an input syntax.

We discussed the Turing completeness of C a while ago on HN ( https://news.ycombinator.com/item?id=4795542 ). Also the following was produced around that time:

https://tdotc.wordpress.com/2012/11/20/on-the-turing-complet...

“The combined value of the top three internet companies in the Americas – so, basically, in America – is around $0.75tn (£0.5tn). In Asia, it’s around $0.5tn. In Africa, it’s $50bn. And in Europe, it’s just $25bn.”

In Europe, we have wealth redistribution. A few companies with so much concentrated financial power is not healthy.

There's a conceptual issue with the language and a missing example: what of chords where one part of the chord is pressed longer than another? Or when one part must be staccato and another not?

I can't seem to see how this is expressed with OMN.