tromp

40 ms·

1. 661.▲
   by tromp 2y ago

   > All of the programming languages and operating systems come from America Hyperbole. Of the many counter examples, let's just mention this huge one: Python came out of the Dutch Center for Mathematics and Computer Science (CWI) whe
2. 662.▲
   by tromp 2y ago

   Several are missing due to their choice to show only one per country...
3. 663.▲
   by tromp 2y ago

   uint64 insert_zero_bit(uint64 value, int pos) { uint64 top_mask = ~0u64 << pos; return value + (value & top_mask); } > It only works for inserting exactly 1 bit But is easily generalized to inserti
4. 664.▲
   by tromp 2y ago

   After answering and begrudgingly submitting the personal info they want before showing the results, I got "Whoops! We experienced some kind of failure We are sorry about this! We'll be working extra hard to fix it soon tho! Error:
5. 665.▲
   by tromp 2y ago

   If you think 3 positions, each 0-1, gives 3^2 options, then please show us the 9th three-bit number. Even simpler is the case of 1 position that is 0-1. Does that give 1^2 or 2^1 options?
6. 666.▲
   by tromp 2y ago

   > ifnt for if(!...). "unless" seems more readable than "ifnt".
7. 667.▲
   by tromp 2y ago

   Or Jim Keller even:-)
8. 668.▲
   by tromp 2y ago

   > Guess a conciseness is a virtue. Indeed; quoting from my winning entry [1] that same year: > This program celebrates the close connection between obfuscation and conciseness, by implementing the most concise language known, Binary L
9. 669.▲
   by tromp 2y ago

   https://archive.is/uJLa4
10. 670.▲
    by tromp 2y ago

    The first Mersenne prime since 1996 not to be discovered on x86 hardware, but on an NVidia A100 [1]. [1] https://www.mersenne.org/primes/
11. 671.▲
    by tromp 2y ago

    https://archive.is/phHqK
12. 672.▲
    by tromp 2y ago

    Winning an IOCCC contest is far from being useless though:-)
13. 673.▲
    by tromp 2y ago

    I recently managed to fit Loader's number, which is about the largest finite number ever conceived of that's still computable by a small program, into a mere 233 bytes of code. No practical use except as an entry in golfing contes
14. 674.▲
    by tromp 2y ago

    There's also https://riecoin.xyz/ searching prime constellations.
15. 675.▲
    Electric Motors Are About to Get a Major Upgrade Thanks to Benjamin Franklin(wsj.com)

    2 points by tromp 2y ago|1 comments
16. 676.▲
    by tromp 2y ago

    You forgot one important property: it must commit to the new block(header).
17. 677.▲
    by tromp 2y ago

    There's also https://gapcoin.org/ for searching prime number gaps (mine the gap).
18. 678.▲
    by tromp 2y ago

    https://archive.is/mMh0y
19. 679.▲
    by tromp 2y ago

    So you get, with equal probabilities, 0+1, 0+2, 1+2, 0+4, 1+4, or 2+4 = {1,2,3,4,5,6}. Same as 2:07 in the video, but using only 1/3 of the faces. Brilliant!
20. 680.▲
    by tromp 2y ago

    > the 45 trillion operations per second that’s listed in the specs Such a spec should be ideally be accompanied by code demonstrating or approximating the claimed performance. I can't imagine a sports car advertising a 0-100km&#x2F
21. 681.▲
    by tromp 2y ago

    > we have added the SWAP function available on demand, applicable to any sequence of words. What is {SWAP Hello} ? Or {SWAP one two three} ? > It's a mistery. A mystery, even:-)
22. 682.▲
    by tromp 2y ago

    https://archive.is/jYivf
23. 683.▲
    by tromp 2y ago

    https://archive.is/VLVYs
24. 684.▲
    by tromp 2y ago

    Lack of 64-bit ints didn't help either...
25. 685.▲
    by tromp 2y ago

    These are already widely known as register machines [1]. [1] https://en.wikipedia.org/wiki/Register_machine
26. 686.▲
    by tromp 2y ago

    https://archive.is/WqBPA
27. 687.▲
    by tromp 2y ago

    The preferred measure of information content is simply number of bits as used for instance in Algorithmic Information Theory [1]. [1] https://en.wikipedia.org/wiki/Algorithmic_information_theory
28. 688.▲
    by tromp 2y ago

    https://archive.is/zA4Xb
29. 689.▲
    by tromp 2y ago

    How do you use that for lists that do not simply iterate, like ghci> fibs = 0 : 1 : zipWith (+) fibs (drop 1 fibs) ghci> take 10 fibs [0,1,1,2,3,5,8,13,21,34] ?
30. 690.▲
    by tromp 2y ago

    > One of the major elements that sets Elixir apart from most other programming languages is immutability. It's interesting to compare Elixir to that other immutable programming language: Haskell. In Elixir, a binding counter =