tromp

43 ms·

691.
by tromp 2y ago
https://archive.is/AYlsC
692.
by tromp 2y ago
Our "logical" rules of Go [1] can be translated pretty directly into Haskell (links below rules). [1] https://tromp.github.io/go.html
693.
by tromp 2y ago
That's not the case in Holland; with soy milk costing 0.89 [1] and cow milk costing 0.99 [2]. [1] https://www.ah.nl/producten/product/wi565765/ah-terra-planta... [2] https://www.ah.nl/pro
694.
by tromp 2y ago
https://archive.is/iFdqs
695.
by tromp 2y ago
I set out to make Loader's number [1], about the largest computable (*) number in googology, fit inside the 280 bytes of a tweet. After succeeding with a 2236 bit program, I got the idea to further improve the size by using Higher Orde
696.
by tromp 2y ago
The article admits that real machines have bounded memory, the argument is about language specifications only.
697.
by tromp 2y ago
Sure; one of the simplest languages possible, the binary lambda calculus [1] is Turing complete. It has no pointers, no variables, and no data type sizes. Only functions (from functions to functions). Everything else must be built out of fu
698.
by tromp 2y ago
I agree it seems wildly optimistic.
699.
by tromp 2y ago
It intends to rely on fees, i.e. to have a constant backlog of high fee paying transactions. We'll see how that plays out within a few decades as the block subsidy becomes insignificant.
700.
by tromp 2y ago
I would change the emission so as to deter speculation and instead make it fair across generations: fix the block reward. I would make it as simple as possible so as to better stand the test of time.
701.
by tromp 2y ago
Or as I remember it: Rich is not he who has a lot, but he who needs little.
702.
by tromp 2y ago
Indeed they improved the tape cell size by an order of magnitude, to be about the minimum possible.
703.
by tromp 2y ago
No, you're reading it right. It's a different function based on a different model of computation so the values are going to be quite different.
704.
by tromp 2y ago
There's no sign of Collatz-like behaviour in any of the 37 known values of BBλ [1], so it appears specific to Turing Machines, which cannot compute exponentials so easily. [1] https://oeis.org/A333479
705.
by tromp 2y ago
https://archive.is/XbNmU
706.
by tromp 2y ago
They're quite rare but we do have some steep hills, like this 22% one: https://www.google.com/maps/@50.8471239,5.8741469,3a,90y,196...
707.
by tromp 2y ago
* Wordle * Chess https://www.chess.com/puzzles/rated * TsumeGo https://play.google.com/store/apps/details?id=com.zhengping.... * Rogule (dungeon) https://rogule.com/ * Flow F
708.
by tromp 2y ago
Israel's bombing of Gaza made them look like a terrorist organization. I believe the majority of deaths and a significant fraction of injured in this attack are in fact Hezbollah members.
709.
by tromp 2y ago
I see what you did there [1]. [1] https://news.ycombinator.com/item?id=41577878
710.
by tromp 2y ago
https://archive.is/2RvY0
711.
by tromp 2y ago
Turing Machines are just one of many computational models. Others offer more parallelism. Two examples: In lambda calculus, disjoint redexes can be reduced in parallel. And in interaction nets, all active pairs can be reduced in parallel [1
712.
by tromp 2y ago
Even looking at this, I find it still very hard to see how it's computing x*y for arbitrary values of x and y...
713.
by tromp 2y ago
This was a bit hard to read, requiring some note taking and some factorizating to check the correspondence between variable names and primes. > You can get the product of two registers(x*y) by keeping an intermediate result and state reg
714.
by tromp 2y ago
> When you publish a new transaction and broadcast it to your peers, the attacker can detect that it is indeed a new transaction (since it is the first time it's seen by the attacker nodes) and that the IP address of your node is th
715.
by tromp 2y ago
The factorization of large prime p is simply p.
716.
by tromp 2y ago
I hoped this article would explain how many logical qubits are required to run the fully general Shor's algorithm (without precompilation cheats and such) to factor e.g. the product of two 6-bit primes, but it seems more geared to adve
717.
by tromp 2y ago
An even more minimal Haskell compiler and combinatory logic runtime won in the 26th IOCCC: https://crypto.stanford.edu/~blynn/compiler/ioccc.htm
718.
by tromp 2y ago
The focus of the documentary is the ZX Spectrum, the (far more successful) successor of the ZX 81 that you had. It came with 16KB or 48KB standard, and featured 16 colors.
719.
by tromp 2y ago
For Proof-of-Work applications, at least in blockchains, you need puzzles that * can be pseudo randomly generated from a seed (usually the hash of a partial blockchain header) * have a known optimal solution method with a (nearly) constant
720.
by tromp 2y ago
The problem of finding cycles in (pseudo randomly generated) graphs is actually one of the first examples of an asymmetric Proof-of-Work puzzle [1]. Asymmetry means that while finding a cycle takes a lot of memory and effort, a solution c

More ›