Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
omazurov
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
by
omazurov
3y ago
No mature, sensible code allows for 10x performance improvement (let alone...). Every time I see a statement like this I take it as a confession.
2.
▲
by
omazurov
3y ago
My personal recommendation for a Tarkovsky's first is his diploma film The Steamroller and the Violin (1960, 46 min, co-written with Andrei Konchalovsky). It was surprisingly watchable [for me] and I wish I had watched it first mysel
3.
▲
by
omazurov
3y ago
You get JFR's precision but inherit its blind spots as described in [1]: > demo1: ... JFR will not report anything useful at all, since it cannot traverse stack traces when JVM is running System.arraycopy() I'd rather run jst
4.
▲
by
omazurov
3y ago
>Profilers are not rocket science... They are not. There are orders of magnitude more rocket scientists than good profiler writers. And no, bottle rockets with flight recorders do not count.
5.
▲
by
omazurov
4y ago
>...retrocausal models also open avenues of exploring a “time-symmetric” view of our universe, in which the laws of physics are the same regardless of whether time runs forward or backward. ... or sideways! If you want a visual model t
6.
▲
by
omazurov
4y ago
Necessity is the mother of invention? (Голь на выдумки хитра? :( )
7.
▲
by
omazurov
4y ago
I can only repeat my initial statement: > Multi-dimensional RS codes are an easy way to get to an absurdly huge size for real. "Multi-dimensional" may mean 3,4,..,10 dimensions. "Absurdly huge" means a petabyte and
8.
▲
by
omazurov
4y ago
I'm not talking about CD-ROMs or immediate availability in any form. How would you encode a petabyte (for a starter) with LDPC/Turbo? Not available right away but accumulated over months with no predefined upper limit? Computation
9.
▲
by
omazurov
4y ago
> Larger and larger block sizes are important. LDPC probably is the more practical methodology today, though I admit that I'm ignorant about them. Still cool to see someone try to push Reed Solomon to such an absurdly huge size tho
10.
▲
by
omazurov
4y ago
> But I’m here to tell you they got it wrong, and everyone’s been getting it wrong ever since. Students come away underwhelmed and baffled, and go on to become the next generation of teachers who repeat this process. Yeah, this is how
11.
▲
by
omazurov
4y ago
That's why there should be another parameter: you should split the key into N parts so that any M <= N can open the lock. You can increase M adding people you don't trust 100%, say to 8, but leave N at your comfortable level, 5
12.
▲
by
omazurov
5y ago
>> helped kindle the European Renaissance as we know it. > The italian renaissance started in the 14th century for sure and maybe even in 13th century depending on who you ask. Though the exact date can be disputed, nobody dispu
13.
▲
by
omazurov
5y ago
> Free will does not exist. It is logically inconsistent... That line of argument makes no difference between the free will of humans and that of animals, insects, bacteria or rocks. But that can't possibly be true: we humans inve
14.
▲
by
omazurov
5y ago
It's plain Java (i.e. JVM/JIT), ForkJoinTask based implementation. As in the original implementation, measurement is done around the quickSort() call. One point is actually that the parallel quick sort algorithm is a bad benchmark
15.
▲
by
omazurov
5y ago
Increasing the size of the array 10x (100_000_000) and filling a glaring omission: Go (go1.17.1 darwin/amd64) took 5.591593544s took 5.285948722s took 5.218750076s took 5.239224787s took 5.131232207s Zig (0.9.0
16.
▲
by
omazurov
5y ago
> Instead of memorizing 20x20 combinations, you limit yourself to a standard 10x10 table (just 25% of all combinations) Actually, 26% (55/210). You say 25% and nobody notices. You say 26% and you convey a message you understand th
17.
▲
by
omazurov
5y ago
Please see my example below.
18.
▲
by
omazurov
5y ago
> If you're spawning one million threads, each of which will perform a blocking operation, then you're likely not CPU bound Imagine a DAG with million nodes. Each node takes data from all its input edges, processes it and sen
19.
▲
by
omazurov
5y ago
I thought the promise was we'd use Threads for everything and forget to worry about blocking calls. I can't run one OS thread per CPU in my proposed benchmark: I want to run millions of threads. Reimplementing it in a different co
20.
▲
by
omazurov
5y ago
>... delimited continuations (of some form) I expect internal implementation of continuations in Loom to have non-negligible overhead which may be justified for heavy blocking I/O operations but not for CPU-bound workloads. One be
21.
▲
by
omazurov
5y ago
A friend of mine who had lived in the USA long enough to pick up some local traits had to go back to Russia to renew his expiring documents. One required a fresh photo to be taken. The guy who was readily available next door for the occasio
22.
▲
Rockwell Automation Retro Encabulator PR
(github.com)
2 points
by
omazurov
5y ago
|
0 comments
23.
▲
by
omazurov
6y ago
For weekend's entertainment: making Game of Life time reversible. Isotropically. https://github.com/OlegMazurov/Janus
24.
▲
by
omazurov
6y ago
> Shared mutexes are ruled out trivially, because as soon as one thread obtains the mutex, your worst enemy could simply never schedule that thread again. Another possibility is that the thread dies while holding a mutex (or exclusivel
25.
▲
by
omazurov
6y ago
For your goods, services... The U.S. of A. is a debt hub. Banks are also debt hubs but on a smaller scale and dependent on their sovereign.
26.
▲
by
omazurov
6y ago
>Suppose you have $100 in cash... Now if you realize that that $100 is a mere IOU from the U.S. of A. you may get a feeling you are onto something...
27.
▲
by
omazurov
6y ago
Most likely "Who's behind the wall?" [0] [0] "Кто за стеной?" (1977) https://www.youtube.com/watch?v=ECvsD4b0JlU
28.
▲
by
omazurov
6y ago
The binary Golay code works on bits. Reed-Solomon code works on symbols that are comprised of many bits. A RS code with 12 data and 12 parity symbols (not bits!) must have symbol representation of at least 5 bits to cover 12 + 12 = 24 possi
29.
▲
by
omazurov
6y ago
> In this post I haven’t really provided any references, but hopefully in future I’ll do short posts explaining where these ideas came from. One such reference might be "Strong and Weak Emergence" by David Chalmers [0], given
30.
▲
by
omazurov
6y ago
The article could have mentioned this as well: German researchers want to send out hundreds of thousands of coronavirus-antibody tests over the coming weeks, Der Spiegel reported. People who test positive for the antibodies could be given
More ›