tromp

19 ms·

391.
by tromp 1y ago
Enjoy your uncapped supply of food and drinks, with each kg almost infinitely divisible into septillions of molecules.
392.
by tromp 1y ago
The ones that allow hundreds of txs per second, making verification of the entire tx history orders of magnitude harder. The limited tx throughput of bitcoin is a feature, not a bug.
393.
by tromp 1y ago
The capped emission certainly encourages FOMO and speculation. A fixed block reward would still provide scarcity in the long term while strongly discouraging speculation [1]. [1] https://tromp.github.io/blog/2020/1
394.
by tromp 1y ago
requiring much higher resources to run a node and making them much less decentralized.
395.
by tromp 1y ago
IMO scalable quantum computers are still more than 2 decades away. Lack of security due to exponentially reducing block rewards and occasional periods of low tx volume could become a problem sooner.
396.
by tromp 1y ago
I read the FAQ and Pocket Manifesto. It provides zero information on the maximum hashrate of your device on various PoW systems. So the user has no idea whether, given current blockchain hashrates and coin prices, they can expect to make $0
397.
by tromp 1y ago
How many lifetimes will it take to recover the $167 cost of the miner, assuming you get the 700mW of solar power for 8 hours a day, mining the most profitable cryptocurrency as of today?
398.
by tromp 1y ago
https://archive.is/BAOUR
399.
by tromp 1y ago
https://archive.is/xoTV5
400.
by tromp 1y ago
That would make more sense if you use the word computation instead of function.
401.
by tromp 1y ago
The article presents a false dichotomy: > Gold is relatively scarce, with an annual inflation rate of 1.5%. However, the supply is not capped. > There will never be more than 21,000,000. It is designed to be deflationary, meaning ther
402.
by tromp 1y ago
While there is https://graphics.stanford.edu/projects/brookgpu/lang.html , I see no indication it was named after him.
403.
by tromp 1y ago
> it is a function about Turing machines, which is how the BBF gets the special properties/results that it does. The properties of the Busy Beaver function carry over to any other computational model you could base it on. E.g. the l
404.
by tromp 1y ago
https://archive.is/bK2OU
405.
by tromp 1y ago
I checked the top hit [1] for googling "how do wings really generate lift" which, being a NASA webpage, instilled some confidence they would have the correct explanation. But alas: > Airplane wings are shaped to make air move f
406.
by tromp 1y ago
You need a few dozen logical qubits. Qubits that have negligible errors and do not lose coherence. The problem is that a single logical qubit takes hundreds of physical qubits and advanced error correction techniques to construct.
407.
by tromp 1y ago
That list is of type (Fractional a, Enum a) => [a], but ghci defaults to Doubles, as you can see from ghci> [0, 0.3 .. 2.0] :: [Float] [0.0,0.3,0.6,0.90000004,1.2,1.5,1.8000001,2.1000001] ghci> [0, 0.3 .. 2.0] ::
408.
by tromp 1y ago
Not with a polynomial-time reduction though. Quoting from [1]: > Generically, reductions stronger than polynomial-time reductions are used, since all languages in P (except the empty language and the language of all strings) are P-comple
409.
by tromp 1y ago
You might as well ask what would be required to factor an 8 bit integer key. Because decades after the factorization of 21, we're still waiting for a quantum computer able to factor any product of two 4-bit primes with the general Shor
410.
by tromp 1y ago
Haskell is relatively WTF free as a language, behaving pretty much like the lambda calculus, but the standard libraries have their share of WTFs, such as the Enum instance for Double: ghci> [0, 0.3 .. 2.0] [0.0,0.3,0.6,0.8999999999999999
411.
by tromp 1y ago
None of them halt, since no halting state is ever introduced into these canvas dwelling TMs :-(
412.
by tromp 1y ago
If 10% of Google tech workers go on strike to demand changes, Can Google afford to fire them all?
413.
by tromp 1y ago
Does the gridbach server trust all submitted results to be correct, or can it somehow verify them (much faster than the outsourced computation) ? I managed to contribute 2B verifications in a few minutes.
414.
by tromp 2y ago
The halting problem requires both 1) unlimited length of programs whose halting behaviour is to be decided (so it can not be limited to program of at most 10 petabytes) 2) for those programs to have unlimited memory available You're ar
415.
by tromp 2y ago
SCOTUS granting the president far reaching immunity was an invitation for the president to be in contempt of SCOTUS whenever it pleases him, and to just piss on the constitution he took an oath on defending.
416.
by tromp 2y ago
> (Y(f))(x) = f(f(f(...(x)...))) I think that should be (Y(f))(x) = f(f(f(...)))(x)
417.
by tromp 2y ago
> you technically can't do name = term But you can do let name = term in term2 by de-sugaring it to ((λname. term2) term)
418.
by tromp 2y ago
> the cost of storing data is less than the cost of figuring out what to do with the crap. Or the cost of figuring out that it's not worth saving...
419.
by tromp 2y ago
The salient part: > The time to halt this trading of assets for consumables is now, and I have a plan to suggest for getting it done. My remedy may sound gimmicky, and in truth it is a tariff called by another name. But this is a tariff
420.
by tromp 2y ago
Both Graham's Number and Loader's Number appear as lower bounds in the functional Busy Beaver at https://oeis.org/A333479

More ›