thesz

23 ms·

241.
by thesz 10mo ago
Early Stack Overflow, in 2008, was an effort of mostly one engineer (Jeff Atwood) and scaled on that single man power to the tens of thousands of users. https://en.wikipedia.org/wiki/Stack_Overflow It is NOW that Stack
242.
by thesz 10mo ago
> but nested transaction support doesn't seem that much of a reach if you're an MVCC-style system anyway You are talking about code that have to be written and tested. Also, do not forget about double COMMIT, intentiona
243.
by thesz 10mo ago
For this database has to have nested transactions, where COMMITs do propagate up one level and not to the actual database, and not many databases have them. Also, a double COMMIT may propagate changes outside of agent's playbox.
244.
by thesz 10mo ago
44% is not marginal. "Marginal" is what perceived by seller and buyer as negligible and it tops at 5%.
245.
by thesz 10mo ago
Blocks are Merkle trees, only the head transaction contains global seed. So, for one to mine block, one needs to walk Merkle tree up from head and then finish work with small amount of data in the block header. Thus, the time spent mining b
246.
by thesz 10mo ago
https://timharris.uk/papers/2005-ppopp-composable.pdf - Composable Memory Transactions. Page 13 discuss why imperative approach like Rust's may fail in delivering transactional memory and why arbitrary-side-effect
247.
by thesz 10mo ago
https://en.wikipedia.org/wiki/Energy_density Gunpowder is 4-10 times less energy dense than gasoline. The difference is that gunpowder includes fuel and oxygen-producing substances, much like most of Li-ion batteries.
248.
by thesz 10mo ago
The mistake there is a classical example of why (software) transactional memory is valuable. Double linked lists are trivial in single core execution, need PhD level understanding of everything in multicore execution and become trivial agai
249.
by thesz 11mo ago
Here, page 31 on: https://wiki.haskell.org/wikiupload/4/46/Hiw2012-duncan-cout... Erlang circa 2012 was even less reliable than TCP on which its interprocess communication was based. Namely, TCP allows for an
250.
by thesz 11mo ago
There is no such thing as "Communicating Sequential Processes with faulty channels and processes." I tried to find something like that, fruitlessly. This means that Erlang does not implement CSP, it implements something else. Agai
251.
by thesz 11mo ago
>> Its' interprocess communication is TCP based in general case > No, it is not. Only between machines is that true. It is true for communication between two VMs on same machine, isn't it? The general case inclu
252.
by thesz 11mo ago
They build channels on top of these "promises" and "futures" and this made them square into communicating sequential processes category. Also, you can look at promise-future pair as a single-element channel, again, it&#x
253.
by thesz 11mo ago
> We know this because we can test what aspects of neurons actually lead to practical real world effects. Electric current is also quantum phenomena, but it is also very averaged in most circumstances that lead to practical real
254.
by thesz 11mo ago
The complexities of contemporary computers and complexities of computing-related infrastructure (consider ASML and electricity) are orders of magnitudes higher than what was needed for first computers. The difference? We have something that
255.
by thesz 11mo ago
> Human brains aren't magic, special or different. DNA inside neurons uses superconductive quantum computations [1]. [1] https://www.nature.com/articles/s41598-024-62539-5 As the result, all living cell
256.
by thesz 11mo ago
These displays use rotating mechanisms. This ones does not: https://www.youtube.com/watch?v=wrfBjRp61iY Volumetric display in the video above uses static projector whose pixels light up etchings inside solid glass.
257.
by thesz 11mo ago
SparseCores appear to be block-sparse as opposed to element-sparse. They use 8- and 16-wide vectors to compute. Here's another inference-efficient architecture where TPUs are useless: https://arxiv.org/pdf/2210.082
258.
by thesz 11mo ago
> ...when he's not working is when he's depressed. The cure for that is known since dawn of time - walking. Holmes, being an exceptionally observant man, definitely would observe that walks raise the mood, allow for (mo
259.
by thesz 11mo ago
5 days ago: https://news.ycombinator.com/item?id=45926371 Sparse models have same quality of results but have less coefficients to process, in case described in the link above sixteen (16) times as less. This means that the
260.
by thesz 11mo ago
One can do a direct translation from Rust AST/IR to C. Many functional languages do that, C++ started as a compiler to C.
261.
by thesz 11mo ago
Atom [1] is an EDSL that escaped Haskell GC. Note that Atom takes ideas from Bluespec which compiles to hardware circuits, where GC is not availble. [1] https://hackage.haskell.org/package/atom One can make a Hask
262.
by thesz 11mo ago
What is language feature in some language is a library in Haskell.
263.
by thesz 11mo ago
Transformers are performing (soft, continuous) beam search inside them, the width of beam being not bigger than number of k-v pairs in attention mechanism. In my experience, having a Markov Chain to be equipped with the beam search greatly
264.
by thesz 11mo ago
> A markov chain model will literally have a matrix entry for every possible combination of inputs. The less frequent prefixes are usually pruned away and there is a penalty score to add to go to the shorter prefix. In the end, a
265.
by thesz 11mo ago
This looks no harder than to train custom Kaldi (circa 2017) phoneme model on brain waves, and using remaining Kaldi's functionality for everything else, except for text-to-speech. There was WaveNet for the TTS at that time, with sound
266.
by thesz 11mo ago
What is a word in one language is a collocated words in another, possibly context-dependent. We can look no further than English: "man can do something," "man can do not do something" (i.e., can do but does not have to),
267.
by thesz 1y ago
A case of Solomon Shereshevsky [1] is very relevant here. [1] https://en.wikipedia.org/wiki/Solomon_Shereshevsky He had synesthesia that made him unable to forget things for most of the life. His memory was so good he
268.
by thesz 1y ago
If you doing your own Forth CPU, make a barrel one [1] to hide any overhead. State of such individual CPU is small, you can easily have thousands of them. [1] https://en.wikipedia.org/wiki/Barrel_processor If you do yo
269.
by thesz 1y ago
> something better than anything else in this category That is a strong statement. [1] https://en.wikipedia.org/wiki/Id_(programming_language) Id [1] was run on the CM-5 (then) supercomputer and demonstrated
270.
by thesz 1y ago
I took a look at the Taelin's work [1]. [1] https://github.com/HigherOrderCO/HVM From my understanding, main problem there is a compilation into (optimal) CUDA code and CUDA runtime, not language or internal repre

More ›