nickdrozd

13 ms·

91.
“Mother of Giants” Turing Machine(sligocki.com)
2 points by nickdrozd 5y ago|0 comments
92.
Total functions and partial functions(nickdrozd.github.io)
1 points by nickdrozd 5y ago|0 comments
93.
Accessible independence results for Peano Arithmetic (1982) [pdf](cs.tau.ac.il)
1 points by nickdrozd 5y ago|0 comments
94.
Godel's 2nd Incompleteness Theorem Explained in Words of One Syllable [pdf](languagelog.ldc.upenn.edu)
1 points by nickdrozd 5y ago|0 comments
95.
A Formal Theory of Spaghetti Code(nickdrozd.github.io)
99 points by nickdrozd 5y ago|42 comments
96.
by nickdrozd 5y ago
I'm sure it seems unremarkable to you, but you are on the borderline of being a prominent enough user that your config is ipso facto noteworthy. (Less prominent than someone like Donald Knuth, but more prominent than someone like me.)
97.
by nickdrozd 5y ago
> In an Emacs file, Gackle collects a list of contradictory statements that people have used to describe Hacker News. dang, could you please describe your Emacs setup?
98.
Latest Beeping Busy Beaver Results(nickdrozd.github.io)
1 points by nickdrozd 5y ago|0 comments
99.
A better Turing machine tape model(nickdrozd.github.io)
23 points by nickdrozd 5y ago|16 comments
100.
Brady's Algorithm for Program Generation(nickdrozd.github.io)
2 points by nickdrozd 5y ago|0 comments
101.
Another new record in self-cleaning Turing machines(nickdrozd.github.io)
90 points by nickdrozd 5y ago|8 comments
102.
A Christmas Tautology (2020)(nickdrozd.github.io)
1 points by nickdrozd 5y ago|0 comments
103.
A History of Busy Beaver Hardware(nickdrozd.github.io)
2 points by nickdrozd 5y ago|0 comments
104.
Macro Turing Machines(turbotm.de)
3 points by nickdrozd 5y ago|0 comments
105.
EmacsConf 2021 Videos(emacsconf.org)
2 points by nickdrozd 5y ago|0 comments
106.
A Busy Beaver champion derived from scratch(nickdrozd.github.io)
99 points by nickdrozd 5y ago|33 comments
107.
Binary Relations in Idris(nickdrozd.github.io)
1 points by nickdrozd 5y ago|0 comments
108.
How to Defend Good Code(codewithjason.com)
3 points by nickdrozd 5y ago|0 comments
109.
The Great Tree-List Recursion Problem (2000)(cslibrary.stanford.edu)
70 points by nickdrozd 5y ago|19 comments
110.
A Busy Beaver champion derived from scratch(nickdrozd.github.io)
1 points by nickdrozd 5y ago|0 comments
111.
by nickdrozd 5y ago
Emacs comes with a manual called "An Introduction to Programming in Emacs Lisp". It says: > I hope that you will pick up the habit of browsing through source code. You can learn from it and mine it for ideas. Having GNU Emacs i
112.
Untangling the Tale of Ada Lovelace(writings.stephenwolfram.com)
1 points by nickdrozd 5y ago|0 comments
113.
Rap Is Slower Around Houston (2000)(nytimes.com)
1 points by nickdrozd 5y ago|0 comments
114.
Can Evening Papers Make a Comeback? (1988)(chicagotribune.com)
1 points by nickdrozd 5y ago|1 comments
115.
by nickdrozd 5y ago
> in practice, what kind of proof are people building when building real world programs ? Here's an example of a proof from a Turing machine simulator written in Idris [1]. The claim is that the length of the tape never decreases af
116.
by nickdrozd 5y ago
Suppose you are at some node. Here are two questions you might ask: 1. How did I get here? 2. Where will I go next? In the first program, those questions are pretty easy to answer. Node D has two entry points and node A has two exit points,
117.
by nickdrozd 5y ago
It's possible to write the first one straight out in C using only whiles, with no breaks and no continues. Can the same be done with the second? Maybe, but I couldn't figure out how.
118.
by nickdrozd 5y ago
> Ascribing qualities of being well structured or spaghetti code to programs as tiny as ~40 bits seems an exercise in futility. I disagree. There are two programs given in the post, each requiring just 32 bits to describe, and the first
119.
Maybe the spaghetti code conjecture is false(nickdrozd.github.io)
111 points by nickdrozd 5y ago|47 comments
120.
by nickdrozd 5y ago
No, I mean the number of legal Go and chess positions vs Busy Beaver numbers. BB sequences don't have much in the way of summits, but they do allow for establishing basecamps more precisely.

More ›