Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
walrus
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
17 ms
·
121.
▲
From Novice to Master, and Back Again
(blog.djmnet.org)
351 points
by
walrus
12y ago
|
27 comments
122.
▲
by
walrus
12y ago
You could start writing it.
123.
▲
Counting bytes fast
(fastcompression.blogspot.com)
128 points
by
walrus
12y ago
|
47 comments
124.
▲
by
walrus
12y ago
I wonder if offering permissively licensed HDL implementations would help uptake on the hardware side.
125.
▲
Daala: Painting Images for Fun (and Profit?)
(people.xiph.org)
117 points
by
walrus
12y ago
|
25 comments
126.
▲
by
walrus
12y ago
In most real-world cases, it'll look like this: gzip+Homogenius < gzip < Homogenius < original JSON gzip+Homogenius will typically be better than just gzip because Homogenius 'knows' about the structure of JSO
127.
▲
by
walrus
12y ago
It's a trick to make the simulation more stable. Stacking in physics engines is difficult. It's a careful balance between speed and stability. If this demo took place on Earth, the Jenga blocks would have to be 1.96 meters long in
128.
▲
by
walrus
12y ago
Looks good! Seems to have a strong treatment of algebraic codes and coding bounds. For those interested in reading, you'll probably want some background in linear algebra. All the necessary definitions are included in the text, but it
129.
▲
by
walrus
12y ago
The most well-known application is sending data over an unreliable channel, such as a radio link or fiber optic cable. It is written in English.
130.
▲
by
walrus
12y ago
In your JavaScript console, run: var s = document.createElement('script'); s.src = 'https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS_HTML'; document.body.appendChild(s);
131.
▲
by
walrus
12y ago
A more modern implementation of Joy's ideas can be found in Factor[1], which the author of this article (and of Joy) endorsed[2]. Also related: http://tunes.org/~iepos/joy.html . This article considers the relation
132.
▲
by
walrus
12y ago
Your comment about merging two schools of thought reminds me of two blog posts by the designer of Rust: Part 1: http://graydon2.dreamwidth.org/3186.html (discussion: https://news.ycombinator.com/item?id=8026
133.
▲
by
walrus
12y ago
I'm not sure where I fall on this. Sometimes I want to machine-validate all of my proofs, and sometimes I feel it doesn't matter. A couple arguments from the other direction: - Reading and verifying each step of a proof is not n
134.
▲
by
walrus
12y ago
> [...] sudo less /var/log/upstart/app.log, 99999... oh, this log ACTUALLY has 99999 lines. Waiting, Waiting (note to self: google the command to jump to the end, there must be one). G (as in shift-g) jumps to the end
135.
▲
The Open Internet?
(potaroo.net)
2 points
by
walrus
12y ago
|
0 comments
136.
▲
by
walrus
12y ago
It works okay. One shortcoming, as mentioned at https://news.ycombinator.com/item?id=7831680 , is that there is no clear model for state transitions. Let's say that on day 1, you want to use Apache: - apt: name=apac
137.
▲
by
walrus
12y ago
> You don't mind because you think it'll only be used to catch "hardcore criminals & terrorist". Please don't speak for me. I was talking about the information collection, not what they're doing with t
138.
▲
by
walrus
12y ago
You know, I don't really mind that the NSA is collecting this information. What bothers me is that it's not being released to the public. What good are their efforts if no one else can build off of their work?
139.
▲
Types, and two approaches to problem solving
(blog.sigfpe.com)
2 points
by
walrus
12y ago
|
0 comments
140.
▲
by
walrus
12y ago
https://hn.algolia.com/#!/all/forever/prefix/0/by%3Asaraid21...
141.
▲
by
walrus
12y ago
ornithological = relating to birds or tho gonal = perpendicular/independent
142.
▲
by
walrus
12y ago
Functionally, layered and acyclic NNs are the same thing. An arbitrary acyclic NN acts the same as a layered NN with some of the weights fixed at 1 or 0. (Replace any edge crossing n layers in a non-layered acyclic NN with a chain of n node
143.
▲
by
walrus
12y ago
Feedforward neural networks are acyclic; recurrent neural networks are cyclic. Recurrent NNs are harder to train in general.
144.
▲
by
walrus
13y ago
There's a subreddit for these: http://www.reddit.com/r/2048/
145.
▲
Want to make a great puzzle game? Get inspired by theoretical computer science.
(jeremykun.com)
2 points
by
walrus
13y ago
|
0 comments
146.
▲
by
walrus
13y ago
I read I and II in hope that some of those terms would be defined. I came to the conclusion that they have reinvented the turbo encabulator.
147.
▲
by
walrus
13y ago
You can express it formally in terms of a rewrite rule: If Δ is a derivation ending in an expression of the form α(((Qβ)γ)δ)ι, then Δ followed by the term αβι is a derivation. Writing it as \xyz.x is just a less noisy way of saying that.
148.
▲
x86 is Turing-complete with no registers
(mainisusuallyafunction.blogspot.com)
89 points
by
walrus
13y ago
|
23 comments
149.
▲
by
walrus
13y ago
You need to be endorsed by an active user in order to submit papers: https://arxiv.org/help/endorsement
150.
▲
by
walrus
13y ago
The NLTK site says the Python 3 version is still alpha.
More ›