Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
nemo1618
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
38 ms
·
391.
▲
by
nemo1618
7y ago
To grossly generalize: Differentiation does not benefit females in the way it benefits males. Being "average" is a safe mating strategy for females, but not for males.
392.
▲
by
nemo1618
7y ago
My solutions are here: https://github.com/lukechampine/advent Documentation for Zig isn't great, but it's become much easier now that the standard library is searchable: https://ziglang.org/do
393.
▲
by
nemo1618
7y ago
I've been doing Advent of Code in Zig. It's a far cry from "real world" programming, but still a decent way to get a feel for the language.
394.
▲
by
nemo1618
7y ago
If you're using Kolmogorov complexity as your measure of entropy, then the entropy is given by the shortest program required to produce the output. So yes, in your example, you would need to include the code in the entropy measure. Thi
395.
▲
by
nemo1618
7y ago
>John Carmack is going to take a shot at AI. Whatever he accomplishes in that field I hope it will be equally as entertaining as Quake and equally as smart as the fast inverse square root algorithm. John Carmack did not invent the fast i
396.
▲
by
nemo1618
7y ago
I see your point, but this sort of argument depends on the assumption that productivity/enthusiasm is fungible, which it rarely is. You can't just chain Tom7 to an office desk and say, "ok, now channel your creative energies
397.
▲
by
nemo1618
7y ago
The timing aspect is an important part of PoW, but it's not the entire purpose. The Bitcoin whitepaper itself goes on to say, "The proof-of-work also solves the problem of determining representation in majority decision making.&
398.
▲
by
nemo1618
7y ago
Even though the results weren't terribly illuminating, I have to give the author a lot of credit for even attempting to do a proper experiment like this. So much of our programming dogma is based on gut feelings ("it looks cleaner
399.
▲
by
nemo1618
7y ago
Indeed, the article mentions this explicitly: >While most hoaxes on Wikipedia are short-lived (90% of discovered hoaxes are flagged within one hour of creation and only 1% of hoaxes persist for more than a year), those that make it past
400.
▲
by
nemo1618
7y ago
I wonder if any of these are actually not hoaxes, but simply unverifiable or insufficiently notable. Quite a few of the hoax articles are bands, for example; isn't it more likely that they were real, and only played a show or two in so
401.
▲
by
nemo1618
7y ago
Go's stdlib has spoiled me. It was the first language that I used in any serious capacity, and I just assumed that all languages had stdlibs that were more-or-less equivalent in terms of breadth and design. Sadly that is not the case.
402.
▲
by
nemo1618
7y ago
I tried my hand at writing generic map/filter/reduce once, and it turned out to be more nuanced than I thought. Do you want to modify the array in-place, or return new memory? If your reduce operation is associative, do you want t
403.
▲
by
nemo1618
7y ago
>In the end, it's because I value simplicity in usage, rather than the simplicity be in the language constructs. That's interesting, because to me, Go accomplishes this fairly well. Generics, operator overloading, and custom &#
404.
▲
by
nemo1618
7y ago
Oof, don't remind me -- it's been close to a decade since I backed "The Magical Realms of Tír na nÓg: Escape from Necron 7 – Revenge of Cuchulainn: The Official Game of the Movie – Chapter 2 of the Hoopz Barkley SaGa" on
405.
▲
by
nemo1618
7y ago
You might enjoy "Sleep is Death", a two-player game where you collaborate to create a story: http://sleepisdeath.net
406.
▲
by
nemo1618
7y ago
I think this is a form of autogram: https://en.m.wikipedia.org/wiki/Autogram The article even provides a pair of mutually-describing sentences. Hofstadter has described these in at least one of his books, but I don
407.
▲
by
nemo1618
7y ago
And bad things happen when the high/low wires get crossed. A high-overt arguing with a low-overt often leads to confusion and resentment, because the exchange was no big deal to the high-overt, but a hostile act to the low-overt.
408.
▲
by
nemo1618
7y ago
Indeed. Reminds me of arcfide's Co-dfns compiler: >I think the first copyright on this compiler is around 2011. That's 6 years for 750 LoC. That's about 125 lines of code per year. >But that doesn't tell the whole
409.
▲
by
nemo1618
7y ago
xor'ing a value with itself produces 0, so XOR AX,AX is equivalent to "AX = 0". It's a common trick in assembly code because it's faster (and/or maybe more compact, can't remember) than the more obvious MO
410.
▲
by
nemo1618
7y ago
This works, but only if you're sampling the exact same space as the block size. For example, if your cipher outputs 64-bit blocks, but you want to sample in 2^32, you're back to the drawing board, because there's no way to tr
411.
▲
by
nemo1618
7y ago
100% agree -- enthusiasm is not fungible! Sometimes starting over is faster than incremental improvement.
412.
▲
by
nemo1618
7y ago
Actually, that problem sounds fairly well-suited to Haskell, because it's essentially a series of pure transformations. My Haskell is quite rusty, but I imagine the program would look something like: mapM_ putStrLn $ filter start
413.
▲
by
nemo1618
7y ago
Go strings do not need to contain valid UTF-8, although in practice they usually do. A 'range' loop over a string will loop over its UTF-8 codepoints, but in general, a string can contain arbitrary binary data. See https:/&#
414.
▲
by
nemo1618
7y ago
Strings are fixed-size, though. A string is a pointer and a length. It's true that you can't use a slice as a map key, though, even though slices are also fixed-size (pointer, length, and capacity). As I recall, the argument is th
415.
▲
by
nemo1618
7y ago
Nice to see that out-of-bounds panics will now include the offending index. Was that difficult to implement, or just controversial? Seems like something that could have been added a long time ago and saved much frustration when debugging.
416.
▲
by
nemo1618
7y ago
btw, if you have code that currently casts to uint for shifts, you can rewrite it with gofmt: gofmt -r 'y << uint(x) -> y << x' (You'll have to run this multiple times for uint32, uint64 etc. if you sh
417.
▲
by
nemo1618
7y ago
I encourage anyone with chronic wrist pain to look into TMS. This blog post by Y Combinator's Aaron Iba helped me completely cure my RSI: https://aaroniba.net/how-i-cured-my-rsi-pain
418.
▲
by
nemo1618
7y ago
Bitcoin block hashes are expensive to manipulate, but not fundamentally difficult to manipulate. All you need to do is bribe the miners. Let's say you strike a deal with AntPool, which mines about 10% of Bitcoin blocks. If they fin
419.
▲
Geiger: A Geiger counter for memory allocations
(github.com)
3 points
by
nemo1618
7y ago
|
0 comments
420.
▲
by
nemo1618
7y ago
A SERMON ON ETHICS AND LOVE has always stuck with me: "I am filled with fear and tormented with terrible visions of pain. Everywhere people are hurting one another, the planet is rampant with injustices, whole societies plunder
More ›