Kutta

6 ms·

1.
by Kutta 4y ago
It will release approximately no CO2.
2.
by Kutta 5y ago
The "small amounts is cardioprotective" is most likely false, the new recommendation simply reflects this. I recall reading about this in research more than 10 years ago. (Sorry for not citing, I'm on mobile rn)
3.
by Kutta 5y ago
Yes, the point is that the user only has to write an interpreter, not a compiler, the compiler is automatically generated. See also GraalVM's Truffle interpreter or Souffle Datalog.
4.
by Kutta 5y ago
Futamura projection is an entirely standard concept in staged compilation. The hand-wringing is unwarranted.
5.
by Kutta 5y ago
I would also guess they don't give a fuck about the night sky either.
6.
by Kutta 5y ago
Are you literally not aware that all pieces of internet infrastructure currently in use have to be replaced every N years?
7.
by Kutta 6y ago
Arenas have been used in Rust for a long time.
8.
by Kutta 6y ago
> We already have a perfectly good foundation of mathematics. It's called ZFC [1] This is completely missing a core point of category theory and type theory (which is about categories equipped with certain extra structure), which is
9.
by Kutta 6y ago
What you say is kind of interesting but I get the impression that we are talking past each other. id(X): ==(X, rec_0(0, X)) Sorry, what's this supposed mean, is it a definition? The propositional equality type has two or three argument
10.
by Kutta 6y ago
A type system cannot be TC. What you seem to talk about, is that if a type checker can simulate arbitrary TM's through an encoding of its input, then the type checker is necessarily non-total. This is correct. But the Idris checker i
11.
by Kutta 6y ago
I don't see that "normalization implies consistency", which I'm aware of, relates to my previous comment in any relevant way. ZFC and MLTT do not differ in that decidability of proof validity is not related to logical ex
12.
by Kutta 6y ago
Incorrect. Whether the language as a logic is capable of expressing undecidable statements, is orthogonal to whether type checking is decidable. Type checking is analogous to checking proof validity in logics. Commonly used proof systems fo
13.
by Kutta 6y ago
OpenAI should have never been open, named "OpenAI", or advertised itself as being open. At the time of OpenAI's inception, much of the AI risk community deemed it as harmful, although that wasn't spoken out a lot, becaus
14.
by Kutta 6y ago
This tutorial seems to miss the level-based generalization optimization, which is crucial for production-strength HM inference. For, that you can look at: http://okmij.org/ftp/ML/generalization.html
15.
by Kutta 6y ago
I also recommend Nick Bostrom's article "The Future of Human Evolution", predating OP by ten years, which contains essentially the same arguments and conclusions. https://www.nickbostrom.com/fut/evolution
16.
by Kutta 6y ago
Usually it's not possible to form such a predicate. If we have impredicative base universe, then it's possible to form a predicate over all types in the base universe (which may or may not be all types in the language), includin
17.
by Kutta 6y ago
The human spaceflight ability of NASA trended sharply to zero in the last 50 years, with space travel getting more expensive, more dangerous and far less capable than before, going from moon transfer to LEO only to no human spaceflight what
18.
by Kutta 6y ago
Immutability is an implementation detail with no inherent value. What we actually care about is referential transparency, encapsulation & tracking of effects, performance, abstraction, thread/type/memory safety, etc. The State
19.
by Kutta 6y ago
I thought the cost of GC following a pointer into a compact region is basically constant time, or is that incorrect?
20.
by Kutta 6y ago
I agree that storing a reference besides an Entry is probably safer than #touch. It's also similar to arrays slices, where we store reference to the array itself + offsets. The ST-like region typing can be still useful though, because
21.
by Kutta 6y ago
You need something which decreases on each step. You could try to recurse on the number of unvisited nodes in the graph. You can try well-founded recursion if this does not work for some reason.
22.
by Kutta 7y ago
Awful comment. The OP, while not pedagogically ideal, demonstrates proof writing along the Curry-Howard correspondence, an extremely deep topic which predates popular functional programming and OOP by decades. To liken this to "tool fe
23.
by Kutta 7y ago
You can always put a project into a reference class consisting only of failed projects. You can also put this project into the class of Tesla factories, none of which failed so far.
24.
by Kutta 7y ago
Within EU, immediate local demand is barely relevant compared to labor and manufacturing conditions, for setting up a factory. A Tesla factory in Germany will obviously supply at least the whole EU.
25.
by Kutta 7y ago
No.
26.
by Kutta 7y ago
There is no convection in the core of the sun. It is plausible that material has mostly stayed there since the formation of the sun.
27.
by Kutta 7y ago
The only feasible way to have cars and trucks in a zero-net-emission economy is to make them electric. Unless you want to scrap all cars and trucks, the electric versions must eventually be developed and mass-produced.
28.
by Kutta 7y ago
You weigh one more because you consider the evidence, and not just count the headlines on your feed.
29.
by Kutta 7y ago
Having seen episode 4-5 now, I think the last episode was pretty good, and the technical breakdown was actually great. However, episode 4 also wasted an unacceptable amount of time; the intro with the old lady and the pet hunters' part
30.
by Kutta 7y ago
By "spectacular" I did not primarily mean visual effects, and I think the production value of effects in the series is perfectly okay, I instead meant effective dramatization. I've only seen up to episode 3 now, but I can ela

More ›