nickdrozd

6 ms·

31.
by nickdrozd 2y ago
Wow! I don't know if I would call that "structured", but it's pretty clever. And horrifying. Well-done!
32.
by nickdrozd 2y ago
> streetlamp effect I agree completely, all of these kinds of conjectures are shaped by what is detectable. If there are any "dark matter" programs out there, they by definition will be difficult to find. That said, I find it e
33.
by nickdrozd 2y ago
The "states" (A, B, C) correspond to goto targets. The "colors" (0, 1, 2, 3) are runtime data. At each state, the current color is read, and an instruction is executed (print some color, move left or right, goto some sta
34.
by nickdrozd 2y ago
It is sometimes thought that extremely long-running Turing machine programs must be deeply complicated, or "spaghetti code". This new reigning champion program is a counterexample. All things considered, it is relatively simple. T
35.
by nickdrozd 3y ago
Yes, one useful application of Cantor's theorem is to show that anything claiming to enumerate all integer sequences must fail to do so. That's assuming that the sequences can be infinite; if it were the Online Encyclopedia of Fin
36.
by nickdrozd 3y ago
The OEIS is a curated selection of integer sequences. It only includes those sequences deemed interesting (usually mathematically, but also recreationally, and occasionally for some other reason). It's easy to generate a new sequence f
37.
by nickdrozd 3y ago
A fun use of dunder hacking is to modify SomeClass.__new__ to return something other than an instance of SomeClass. Believe it or not, this is occasionally a sensible thing to do! But it can cause problems. For example, the Mypy type checke
38.
Www.thug.com(nickdrozd.github.io)
1 points by nickdrozd 3y ago|0 comments
39.
by nickdrozd 3y ago
> If it is undecidable, it is true. That is the case for something like Goldbach's Conjecture, which says that every even number > 2 is the sum of two primes. If it's false, then there is a counterexample, and it is easy to
40.
by nickdrozd 3y ago
That's a recursive function, so to make it fully general a recursive type can be used: type CompoundInt = int | list[CompoundInt] def fooify(x: CompoundInt) -> CompoundInt: if isinstance(x, int): return x *
41.
by nickdrozd 3y ago
Ideas for anyone who wants to go further with this: 1. Implement the Ackermann function. 2. Implement the factorial function using iterative recursion [1]. Does Jenkins execute the function iteratively or recursively? [1] https:/&#x2F
42.
by nickdrozd 3y ago
Zeilberger is a hardline finitist. According to him, a lot of mathematics is meaningless or at least woefully misguided due to its reliance on infinite sets, which he believes to be nonsense. His opinions are far from mainstream, but they s
43.
Pro-AI?(nickdrozd.github.io)
1 points by nickdrozd 3y ago|0 comments
44.
by nickdrozd 3y ago
> This is one of those new technologies that's useful primarily as a viewfinder on a dismal present and a future determined to be even more miserable. Nobody anywhere will like the smart carts. Nobody, anywhere, will find them not-o
45.
Dystopian "smart" shopping carts that display ads(defector.com)
5 points by nickdrozd 3y ago|2 comments
46.
Eval should not be a built-in function(nickdrozd.github.io)
2 points by nickdrozd 3y ago|0 comments
47.
by nickdrozd 3y ago
Running my project's computation-intensive test suite takes 83 seconds under 3.11 and 67 seconds under 3.12. That's a pretty good improvement!
48.
Tetration(nickdrozd.github.io)
2 points by nickdrozd 3y ago|0 comments
49.
Python Interface / Refactor Challenge(nickdrozd.github.io)
1 points by nickdrozd 3y ago|0 comments
50.
Blogging in the Age of Internet-Scale AI Training(nickdrozd.github.io)
1 points by nickdrozd 3y ago|0 comments
51.
When Only Real Math Will Do(nickdrozd.github.io)
1 points by nickdrozd 3y ago|0 comments
52.
by nickdrozd 3y ago
> You can also get the theorem prover itself to hang or crash; if you work with theorem provers often, you'll even do this unintentionally, many times! Proving something false is a grave sin for a prover. On the other hand, failing
53.
The High Price of Abstraction in Python(nickdrozd.github.io)
3 points by nickdrozd 3y ago|1 comments
54.
There is no such thing as human-generated text(nickdrozd.github.io)
2 points by nickdrozd 3y ago|1 comments
55.
by nickdrozd 3y ago
This post discusses a variety of Lisp macro that doesn't merely expand into something else, but actually reaches out to rewrite its surrounding context . > So people have spent a lot of time thinking about ways to write macros more
56.
Shaquille O’Neal is on the run from FTX lawsuit process servers(defector.com)
13 points by nickdrozd 4y ago|1 comments
57.
Different Topologies for an Org Chart(ntietz.com)
3 points by nickdrozd 4y ago|0 comments
58.
How to print-debug Python comprehensions(nickdrozd.github.io)
2 points by nickdrozd 4y ago|1 comments
59.
by nickdrozd 4y ago
The problem with goto is that it is an unbelievably primitive operator. It can be used to implement any logic at all, and therefore it does not express any logic very clearly. It's a bad way to express intent in code. Aside from the
60.
by nickdrozd 4y ago
Dark matter skeptics believe, in effect, that everything that interacts with gravity also interacts with electromagnetism. They tend to believe this really strongly , but I've never heard anyone give a reason for it. It's a stran

More ›