First, I appreciate the work people have done to make LW 2 happen. Here are my notes:
Why do people see Mars as a better target for human colonization than the Moon? Most comments on lunar colonization seem to refer to two facts:
In my mind, both of these problems can be solved by a ceiling or dome structure. The ceiling both retains the atmosphere and also blocks harmful radiation. Note that a failure in the ceiling won't be catastrophic: the atmosphere won't drain rapidly, and the amount of radiation exposure per unit time isn't disastrously high even without the ceiling.
Very nice, thanks. Ahh... Haskell really is quite pretty.
Good analysis, thanks. I buy the first two points. I'd be shocked to see an implementation that actually makes use of the lower metadata requirements. Are there languages that provide a boolean primitive that uses a single bit of memory instead of a full byte? Also I don't understand what you mean by persistence.
-1, this is pointlessly negative. There's a disclaimer at the top (so it's not like he's claiming false authority), the title is appropriate (so it's not like you were tricked into clicking on the article), and it's reasonably on-topic because LW people are in the software/AI/entrepreneurship space. Sure, maybe most of the proposals are far-fetched, but if one of the ideas sparks an idea that sparks an idea, the net value could be very positive.
Has anyone studied the Red Black Tree algorithms recently? I've been trying to implement them using my Finite State technique that enables automatic generation of flow diagrams. This has been working well for several other algorithms.
But the Red Black tree rebalancing algorithms seem ridiculously complicated. Here is an image of the deletion process (extracted from this Java code) - it's far more complicated than an algorithm like MergeSort or HeapSort, and that only shows the deletion procedure!
I'm weighing two hypotheses:
I'm leaning toward the latter theory. It seems to me that most of the other "elementary" algorithms of computer science are comparatively simple, so the weird overcomplexity of the tool we use for binary tree balancing is some kind of oversight. Here is the Wiki page on RB trees - notice how the description of the algorithm is extremely hard to understand.
Can anyone offer a linguistic explanation for the following phenomenon related to pronoun case and partial determiners:
Theory of programming style incompatibility: it is possible for two or more engineers, each of whom is individually highly skilled, to be utterly incapable of working together productively. In fact, the problem of style incompatibility might actually increase with the skill level of the programmers.
This shouldn't be that surprising: Proust and Hemingway might both be gifted writers capable of producing beautiful novels, but a novel co-authored by the two of them would probably be terrible.
I haven't written it up, though you can see my parser in action here.
One key concept in my system is the Theta Role and the associated rule. A phrase can only have one structure for each role (subject, object, determiner, etc).
I don't have much to say about teaching methods, but I will say that if you're going to teach English grammar, you should know the correct grammatical concepts that actually determine English grammar. My research is an attempt to find the correct concepts. There are some things that I'm confident about and some areas where the system needs work.
One very important aspect of English grammar is argument structure. Different verbs characteristically can and cannot take various types and combinations of arguments, such as direct objects, indirect objects, infinitive complements, and sentential complements. For example, the word "persuade" takes a sentential (that-) complement, but only when also combined with a direct object ("I will persuade [him] that the world is flat" is incorrect without the direct object). In contrast, the verb "know" can take either a direct object or a that-complement, but not both. To speak English fluently, you need to memorize all these combinations, but before you memorize them, you need to know that the concept exists.
Against Phrasal Taxonomy Grammar, an essay about how any approach to grammar theory based on categorizing every phrase in terms of a discrete set of categories is doomed to fail.