Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
omazurov
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
31.
▲
by
omazurov
7y ago
Superdeterminism appears to aspire to come up with a classical model that would explain quantum correlation. If successful it would render a quantum computer to be fancy, highly parallel, very expensive but still a classical one. A non-clas
32.
▲
by
omazurov
7y ago
> Why not just imagine Alice tells Bob how she's going to choose what to write in the boxes? That works 100% of the time too. No, it does not. Let’s suppose Alice’s pre-negotiated (or predetermined by a seeded PRNG) choices for ro
33.
▲
by
omazurov
7y ago
Same thing: greedy algorithms. Mostly imposed by companies "living by algorithms".
34.
▲
by
omazurov
7y ago
> He says, that you should imagine having all cars available in a room and then ask a group of experts to identify the best engine, the best battery, the best transmission, and so on. Afterwards, you take all the parts identified and pu
35.
▲
by
omazurov
7y ago
Thank you so much! From the first look it's right on the money. > Our strategy is to entice smart people to play with programming robust, indefinitely scalable computations by lowering barriers to entry, and as idioms, motifs, and
36.
▲
by
omazurov
7y ago
> In the early days, John von Neumann has looked at the problem of constructing a reliable computer out of unreliable components but the study stopped as von Neumann died and transistors replaced the unreliable valves. We are now faced
37.
▲
by
omazurov
7y ago
> Models are a good, helpful tool. They are just not explaining everything, and that on purpose, and as a human we always need to be aware of that models are just models and not reality. Do we have anything else but models?
38.
▲
by
omazurov
8y ago
Galois (finite) fields are very much relevant in error correction codes and cryptography. Any time you want to manipulate bytes (or words) as numbers which you can add/subtract and multiply/divide you end up learning about finite
39.
▲
by
omazurov
8y ago
Almost 20 years before Searle, a short fictional story by A.Dneprov, "The game", was published in the Soviet pop-science magazine "Knowledge is Power". Not only had it described the essence of the Chinese room setup, it
40.
▲
by
omazurov
8y ago
It turns out there is a simple, though not trivial, conversion from Cauchy to Vandermonde, so all error correction techniques apply.
41.
▲
by
omazurov
8y ago
According to Wikipedia, PAR1 suffered from: > The recovery algorithm had a bug, due to a flaw[1] in the academic paper[2] on which it was based. I remember that the same bug was cited by ZFS[3]. Amazing. Of all algorithm descriptions,
42.
▲
by
omazurov
8y ago
> Cauchy matrices are more foolproof, which is why I started with them. I always wanted to know but was afraid to ask. I see why people choose Cauchy for encoding: it's simple and fast ( more foolproof ? - that I don't see).
43.
▲
by
omazurov
8y ago
Don't confuse individual commands with the operating system, which is highly concurrent. I was very specific in my statement.
44.
▲
by
omazurov
8y ago
Concurrency = logical simultaneity. Parallelism = physical simultaneity. When the former is mapped to the latter we encounter scalability. Some examples: Unix commands (cp, grep, awk, sort) do not scale on multi-core systems due to total la
45.
▲
by
omazurov
8y ago
I found only one occurrence of the word task in the document. The entire paradigm of task parallelism is omitted. The style is heavy. I consider myself skilled in the area but struggled to map wording to my conceptual framework or experie
46.
▲
by
omazurov
8y ago
One would think of the Russian space program... >As Sergei Korolev was said to have joked, the guards who protected him in his high position as the chief designer of the Soviet space program were probably the same ones who watched over
47.
▲
by
omazurov
8y ago
Not so fast :) Your own time would not "come to a halt and disappear", would it? If something travels with you at the same speed it would not get frozen in time. So, "everything that you would be seeing" is a bit too inc
48.
▲
by
omazurov
8y ago
Simulating the Mandelbrot set is also awfully computationally expensive. Unless you know the trick.
49.
▲
by
omazurov
8y ago
> The faster you go, the slower time goes. If you could go as fast as light, you’d see time come to a halt and disappear. No, you wouldn't. Someone observing you would. Am I getting relativity wrong?
50.
▲
by
omazurov
8y ago
> However, Reed–Solomon codes have the disadvantage that they are practical only for small K, N, and q: standard implementations of encoding and decoding have a cost of order K(N-K)log2 N packet operations. Furthermore, with a Reed–Sol
51.
▲
by
omazurov
8y ago
> water/wine = x/(1-x) > wine/water = (1-x)/x It's symmetrical but not "naturally" uniform. If we consider both quantities as independent and uniformly distributed over [0..1[, then 1:1 ratio becom
52.
▲
by
omazurov
8y ago
I wonder what happened to the previous oldest intact shipwreck discovered by Robert Ballard in Black Sea: http://press.nationalgeographic.com/2003/01/16/black-seas-ol...
53.
▲
by
omazurov
8y ago
I think they are developing means to protect their countries.
54.
▲
by
omazurov
8y ago
And I personally want the smartest people in the industry to work on protecting the civilization from other smart people working on domination as a means of "protecting their country".
55.
▲
by
omazurov
8y ago
https://arxiv.org/abs/1704.00690
56.
▲
by
omazurov
8y ago
My favorite algorithm is of course one of my own: a dynamic error correction code which is capable of on-the-fly fixing of errors occurring due to data races in a highly parallel unsynchronized computation. I demonstrated it in the domain o
57.
▲
by
omazurov
8y ago
> Supporting truly massive concurrency requires another optimization: Only schedule a thread when you know it can do useful work! The problem is the scheduler doesn't know when a goroutine can do useful work. It thinks that if a n
58.
▲
by
omazurov
8y ago
> [The Euler Product Formula] states that the sum of the zeta function is equal to the product of the reciprocal of one minus the reciprocal of primes to the power s. This astonishing connection laid the foundation for modern prime numb
59.
▲
by
omazurov
8y ago
You'll earn virtual health point. Maybe an extra life even.
60.
▲
by
omazurov
8y ago
For Java you can do better than perf. Sun's Performance Analyzer [1] has had hardware counter based profiling of real Java (not just JIT-compiled code) for more than 10 years. Open source async profiler [2] seems to be doing a decent j
More ›