nickdrozd

7 ms·

1.
A Tetrational Self-Cleaning Turing Machine(nickdrozd.github.io)
2 points by nickdrozd 14d ago|0 comments
2.
by nickdrozd 29d ago
Congratulations! It's funny that the reward schedule is not based on importance. It's just 0x$1.00 for an error and 0x$0.20 for a suggestion, no matter what. Personally I have 0x$4.40 in the bank, more than the author's 0x$1.
3.
Where are those goalposts? I'm sure I put them here somewhere(nickdrozd.github.io)
3 points by nickdrozd 4mo ago|0 comments
4.
by nickdrozd 9mo ago
Here is an attempt: .de Q .nf .na .pso awk 'BEGIN{bs=sprintf("%c",92); pre=bs"&"} {out=pre; for(i=1;i<=length($0);i++){c=substr($0,i,1); if(c==bs) out=out bs bs; else out=out c} print out}' &qu
5.
by nickdrozd 9mo ago
I gave a few attempts with ChatGPT and DeepSeek. Neither of them could get it right. So this goalpost can remain in place for the time being. (I am assuming that the task is actually possible to accomplish. If it isn't possible, then i
6.
by nickdrozd 9mo ago
How would your views about AI change if that goal were achieved? When my personal goal was reached, I found myself a little bit at a loss for words.
7.
by nickdrozd 9mo ago
What would be a better way to measure intelligence?
8.
Running out of places to move the goalposts to(nickdrozd.github.io)
4 points by nickdrozd 9mo ago|13 comments
9.
Recursive Type Definitions in Rust(nickdrozd.github.io)
3 points by nickdrozd 11mo ago|0 comments
10.
AI-generated music is starting to hit(nickdrozd.github.io)
3 points by nickdrozd 11mo ago|0 comments
11.
The Shape of a Turing Machine(nickdrozd.github.io)
5 points by nickdrozd 1y ago|0 comments
12.
by nickdrozd 1y ago
Turing machine program states are conventionally represented with letters: A, B, C, etc. The starting state is A. Now suppose you are running a Turing machine program from the beginning. The only state it has visited so far is state A. It r
13.
by nickdrozd 1y ago
> The most insane python feature is that for loops keep their intermediate variable. "Insane feature" is a generous way of describing this behavior. I would say it is just a stupid bug that has managed to persist. Probably it i
14.
by nickdrozd 2y ago
Great post. Some general takeaways for people who want Knuth checks: 1. You are unlikely to find errors in the algorithms themselves, especially if they've been officially published. You might find some infelicities, but these are not
15.
by nickdrozd 2y ago
> You never understand other people's code as well as your own. No matter how thoroughly you've read it, you've only read it, not written it. There is certainly some truth to this. On the other hand, it's possible to
16.
An ideology-induced bug in Mypy(nickdrozd.github.io)
2 points by nickdrozd 2y ago|1 comments
17.
by nickdrozd 2y ago
For anyone who finds this sort of discussion interesting, I highly recommend reading Chapter 3 of The Structure and Interpretation of Computer Programs . There is quite a bit of philosophical musing about the connection between time and st
18.
by nickdrozd 2y ago
Looking at some of these screenshots, this is such a fantastic idea that it is surprising it wasn't done earlier. Magit has the perfect interface, why shouldn't everything be like that? Who wants to read the Info manual anyway? In
19.
by nickdrozd 2y ago
Well said. The Magit interface is such a pleasure to use, sometimes I will modify and rearrange commits just for fun. A Magit-style interface for Calc seems like a great idea.
20.
Why Is π So Ubiquitous?(sites.math.rutgers.edu)
1 points by nickdrozd 2y ago|0 comments
21.
Print Debugging and Print Profiling(nickdrozd.github.io)
1 points by nickdrozd 2y ago|0 comments
22.
You don't descend from all your ancestors [video](youtube.com)
4 points by nickdrozd 2y ago|0 comments
23.
What if undecidability shows up all at once?(nickdrozd.github.io)
2 points by nickdrozd 2y ago|0 comments
24.
by nickdrozd 2y ago
> We are selecting for the maximally pathological machines. This is not quite right. We're selecting for maximally long-running (or mark-producing, etc) programs. Whether those programs turn out to be "pathological" in som
25.
by nickdrozd 2y ago
Busy Beaver champion programs are said to run for super-exponentially many steps. But nobody has actually run their simulators for that many steps. Instead, simulators can prove tape fast-forwarding rules. Basically, you look for repeating
26.
by nickdrozd 2y ago
> They have used a proof generator based on a logical theory... I don't understand your scenario. If they're using a proof generator, that sounds like the opposite of intuiting or using the human mind. Maybe they used "int
27.
by nickdrozd 2y ago
Fixed, thanks
28.
by nickdrozd 2y ago
> past BB(3), there isn't any known size where the champion machines for Σ(n) and S(n) are different. My feeling is that this trend cannot continue forever, and for infinitely many N they are different. If they are always the same,
29.
by nickdrozd 2y ago
Congratulations to the team! So the (blank tape) halting problem is solved for 5-state 2-color Turing machine programs. Has anyone tried applying these same techniques to the 2-state 4-color case? That seems like it would probably be tracta
30.
by nickdrozd 2y ago
At the end of the foreword, Kinbote says: > Let me state that without my notes Shade's text simply has no human reality at all, since the human reality of such a poem as his ... has to depend entirely on the reality of its author an

More ›