tromp

45 ms·

931.
by tromp 3y ago
> operating an unlicensed money-transmitting business. Can you be a money-transmitting business if you never have access to any of the funds being transmitted? Samourai only helps aggregate self-spending transactions from each user back
932.
by tromp 3y ago
FSD == Fool Self Driving
933.
by tromp 3y ago
https://archive.is/ODsud
934.
by tromp 3y ago
Carter Bays wrote a paper "Candidates for the Game of Life in Three Dimensions" on that back in 1987 [1] and another in 2006 as mentioned on Wikipedia [2]: [1] https://content.wolfram.com/sites/13/2018&#x
935.
by tromp 3y ago
I lost a bunch of times on level 7 and then was sent back to level 1. Is there a way to avoid redoing completed levels?
936.
by tromp 3y ago
Previous discussions 2 years ago [1] and 7 years ago [2] [1] https://news.ycombinator.com/item?id=32170592 [2] https://news.ycombinator.com/item?id=14232692
937.
by tromp 3y ago
Then you'll be more interested in the 114 bit representation (λ (λ 2 1 (λ 1 (λ λ 1 2 (λ 1)) (λ λ 5 (2 1)) 3) 1) (λ λ 2 (3 2 1))) (λ λ 2 (2 (2 1))) of Graham's number [1]. [1] https://github.com/tromp/AIT/
938.
by tromp 3y ago
Does it successfully compile the above program?
939.
by tromp 3y ago
You don't need the price to keep going up, if you have a permanent backlog of high fee paying transactions. Which is what the Bitcoin design is counting on...
940.
by tromp 3y ago
It allows you to double spend, which is pretty much stealing from the first recipient...
941.
by tromp 3y ago
The notion of PoW predates hashcash. Hashcash is just the simplest PoW algorithm. There are PoW that work entirely differently from Hashcash, such as finding fixed length cycles in random bipartite graphs.
942.
by tromp 3y ago
Instead the security will rely on maintaining a large backlog of high fee paying transactions.
943.
by tromp 3y ago
> Bitcoin’s success was about more than creating a new money; it was about creating a system to distribute value in a way that couldn’t be gamed and that didn’t unfairly advantage any user. Even Satoshi mined all the Bitcoin he received,
944.
by tromp 3y ago
My 1988 submission to the International Obfuscated C Code Contest was this maze generator: char*M,A,Z,E=40,J[40],T[40];main(C){for(*J=A=scanf(M="%d",&C); -- E; J[ E] =T
945.
by tromp 3y ago
It's amazing how often Turing gets miss-spelled as Turning. Is that because of overzealous spell checkers?
946.
by tromp 3y ago
That Stack Exchange thread shows you can exceed Graham's number with the 49 bit lambda term (λ 1 1) (λ 1 (1 (λ λ 1 2 (λ λ 2 (2 1))))), or graphically ┬─┬ ┬─┬────────── └─┤ │ │ ──┬────── │ │ │ ┬─┼────── │ │ │ └─┤ ┬
947.
by tromp 3y ago
Earlier discussions were all flagged... [1] https://news.ycombinator.com/item?id=40072295 [2] https://news.ycombinator.com/item?id=40072892 [3] https://news.ycombinator.com/item?id=40074333
948.
by tromp 3y ago
Teaches you how to build NOT, OR, AND, and XOR gates out of ideal dominoes (that fall perfectly straight).
949.
by tromp 3y ago
> Countering that is the immense gravitational weight of the star itself, pressing inward with all the might that 1,027 tons of hydrogen and helium can muster. More like 2 x 10^27 tons. The first option steals momentum from Jupiter to re
950.
by tromp 3y ago
> Mathematically speaking, no modern lanaguage is turning-complete because memory size on any machine has a fixed upper-bound. Many languages have no memory limit. Some do not even have a notion of memory (e.g. lambda calculus). Language
951.
by tromp 3y ago
Their 2019 bikes [1] claimed the records for fastest woman and fastest university student, but not the absolute fastest cyclist of over 144km/h [2]. [1] https://www.neuralconcept.com/post/speed-bicycle-our-optimiz.
952.
by tromp 3y ago
Acutally, I only learned about the 49 bit program after writing that blog entry. It is described in https://github.com/tromp/AIT/blob/master/fast_growing_and_co...
953.
by tromp 3y ago
It can compute both the starting offset for itself and next_offset for (bx+1)...
954.
by tromp 3y ago
He's proposing to skip the whole computation of the parts[] array and within the kernel, replace for (int i = 0; i < parts[bx].length; i++) { // bx is the global thread index char c = buffer[parts[bx].offset-
955.
by tromp 3y ago
I'd consider trading in my car for a shorter one that does fit in the limited space, since I'm not married to it.
956.
by tromp 3y ago
You don't need to go anywhere near 400 bytes to find inscrutable programs, if your programming language is concise enough. Even 8 bytes, or 64 bits to be precise, offers plenty unchartered territory for finding new gems in lambda calcu
957.
by tromp 3y ago
They're down to 7nm albeit with low yield and questionable legalities [1]. [1] https://www.scmp.com/tech/big-tech/article/3256321/chinese-c...
958.
by tromp 3y ago
As the reddit thread [1] points out: > A functional *electric fireplace. [1] https://www.reddit.com/r/interestingasfuck/comments/ovs7rs/l...
959.
by tromp 3y ago
How does this affect these statements on Wikipedia [1] > some lattice-based constructions appear to be resistant to attack by both classical and quantum computers. Furthermore, many lattice-based constructions are considered to be secure
960.
by tromp 3y ago
At least you can return their freedom and try to compensate them for the time unjustly spent in prison.

More ›