rntz

12 ms·

61.
by rntz 8y ago
This is true, but it has a problem: if you prefer constructive logic to classical because it is "finer-grained", then where do you stop? Linear logic, for example, is finer-grained than both classical and constructive logic. Both
62.
by rntz 8y ago
You say Helm solves or will solve all these problems. But if I don't actually need to be able to reach the box in order to use my email - if it will work even when the box is offline, powered-down, stolen, or destroyed - then what, exa
63.
by rntz 8y ago
You say Helm literally does this. But what the grandparent was asking for wasn't just backups. They suggest (as I see it) an open standard for backups, ubiquitously implemented so it's easy to switch your provider and easy to set
64.
by rntz 8y ago
I agree it would be nice to have a clearer picture of what anti-PC folks think of themselves as being against (and what pro-PC folk think of themselves as being for). However, it's also useful to know people's feelings towards a p
65.
by rntz 8y ago
I think it's fair to debate whether the difference between Scots and English is between two languages or two dialects, but Scots is definitely neither a pidgin nor a creole. Pidgins are highly simplified proto-languages that emerge to
66.
by rntz 8y ago
On rereading, it seems like what may be happening is simply that the problem isn't very large (10-100,000 rows) and doesn't need to be solved very fast (a few minutes), and so the standard Prolog search strategy may have worked ju
67.
by rntz 8y ago
I would like to know what Prolog implementation the author used. In particular, the article claims: 1. > An initial analysis found that we would need to implement a complex depth/breadth search algorithm either in the client applica
68.
by rntz 8y ago
The article gives the hypothetical example of redacting a table row {zip: 85535, age: 79} to {zip: 85xxx, age: 79} on the grounds that there are fewer than k (for some tunable constant k, larger = more anonymity) 79-year-olds
69.
by rntz 8y ago
This algebraic approach to program semantics is basically how categorical semantics works. The syntactic equational theory of the simply typed lambda calculus with pairs, for example, is that of the "free" cartesian closed categor
70.
by rntz 8y ago
The Halting Number. The i'th digit after the decimal point of the Halting Number is 0 if the i'th Turing Machine halts given an empty tape, and 1 otherwise. (The integral part of the Halting Number is 0.) This number is not comput
71.
by rntz 8y ago
In computer science in the US, this is just false. Four years is the usual "officially expected" length of a PhD straight out of a bachelors' (which is the most common way to do a PhD in CS in the US). In practice it usually
72.
Computing, Climate Change and All Our Relationships (video with Transcript)(deconstructconf.com)
2 points by rntz 8y ago|0 comments
73.
by rntz 8y ago
CRDTs and semilattices are definitely connected, but they're not quite the same thing. A CRDT is a data structure that can be merged across the network in a way that's commutative, associative, and idempotent. That much is exactly
74.
by rntz 8y ago
> "hothouse" temperatures could stabilize 4°C to 5°C (39 to 41 Fahrenheit) higher than pre-industrial levels. A change of 4-5°C is a change of 7-9 degrees Fahrenheit, not 39-41.
75.
Are artifacts objects or processes?(rntz.net)
1 points by rntz 8y ago|0 comments
76.
by rntz 8y ago
Why is it that the legal profession is split between prosecutors and defense lawyers? I ask this question in two senses: first, historical - how did it come about? and second, moral - what is the justification? After all, doesn't this
77.
by rntz 8y ago
On the one hand, you're right. Python takes exactly this approach: it disambiguates using "for" and "if": LISTCOMP ::= [ EXPR STMT* ] STMT ::= "if" EXPR | "for" PAT "in" EXPR
78.
by rntz 8y ago
This does work, and is available in e.g. the Parsec library for Haskell, but (1) can lead to exponential worst-case backtracking behavior. (2) can produce very unhelpful error messages without careful engineering. In this case, for list com
79.
by rntz 8y ago
I have a toy problem that I throw at anyone who thinks they've "solved" parsing: Haskell list comprehensions. A list comprehension takes the form "[" EXPR "|" STMT["," STMT]* "]"
80.
by rntz 8y ago
Summary: The article is looking for an efficient way to map a hash code into a smaller power-of-two-sized range, for use as a hashtable index. It dismisses the common solution, masking off the high bits, because it discards information, and
81.
Why I am not a fan of Cabal or Stack(rntz.net)
3 points by rntz 8y ago|0 comments
82.
by rntz 8y ago
> Most of the type systems studied are not used in the wild, so they can't be interesting because they describe something people are already interested in. The only other possible explanation for the relevance of these papers is tha
83.
Sequent Calculus as a Compiler Intermediate Language [pdf](microsoft.com)
3 points by rntz 9y ago|0 comments
84.
by rntz 9y ago
> This has happened over and over again in human history, native American civilizations serve as a great example. A crucial point of contention here is: what counts as a "nation-state"? States of various forms have certainly
85.
by rntz 9y ago
You define 'real' as: "likely to arise in any culture, perhaps in any species that's able". That's a strong claim. Look at your arguments supporting it: > You have a greater interest in reaching consensus wi
86.
by rntz 9y ago
Most people will admit that laws are made up; that they are only good insofar as they produce a good society; that laws serve society, rather than society existing to serve law. Money is a little harder, but IME most people eventually ackno
87.
by rntz 9y ago
That's almost right, but you have the Botai horse and Przewalski's horse confused. The Botai were a human culture living in what is now Kazakhstan, approximately 3700-3100 BCE. They kept domesticated horses, and are the earliest c
88.
by rntz 9y ago
We regard "this program is hard to test" as a problem that's worth refactoring to fix; why shouldn't we regard "this program is hard to verify" the same way?
89.
by rntz 9y ago
If SQL deserves consideration for being "underrated", Datalog certainly does. Compared to SQL, Datalog makes recursive queries very natural[1], making it good for manipulating graph-like structures. For example, here's reacha
90.
by rntz 9y ago
I think Racket is underrated. (Dunno about "most underrated".) It's a batteries-included Scheme/Lisp dialect with the best documentation I've ever seen, a state-of-the-art macro system, and a very friendly community

More ›