milanrosko

Ignore the Theory of Computation. Assume computers can realize smoothness and division, assume the Law of the Excluded Middle. Ignore Russel, Gödel, Tarski, Church, Brouwer, Rice, Friedman. Especially Rice. Ignore what SimPy and TensorFlow actually does. Ignore what CISC and RISC does. Go back to pre rigorous 18th century mathematics...

TLDR; (i) A general introduction to the most underrated tool of proof theory: the Kleene–Mostowski Hierarchy, cf. Arithmetical hierarchy (wikipedia). (ii) The claim is that this diagnostic tool should not remain confined to a specialty; it should be treated as standard equipment wherever one reasons about agents, verification, security and...

Any natural number can be uniquely written as a sum of non-consecutive Fibonacci numbers. This is called Zeckendorf representation. Consider, 15 = 2 + 13, or 54 = 2 + 5 + 13 + 34. This outlines a very weak RE language employing only {N,+,var}. We can also see that...

Consider computation as a thin, linear pipeline: symbol in, symbol out. But in a setting with feedback, branching recursion, and layered state spaces, computation becomes expressive in exactly the way biological systems are: through repeated structure, constraint, and variation, or with one word: algorithmic entropy. TLDR; In a proof theoretic...

Eliezer Yudkowsky has, on several occasions, claimed that AI’s success at protein folding was essentially predictable. His reasoning (e.g., here) is straightforward and convincing: proteins in our universe fold reliably; evolution has repeatedly found foldable and functional sequences; therefore the underlying energy landscapes must possess a kind of benign structure....

I am keeping this comic online as a record of an earlier perspective. My current work in fixed point logic and proof theory has led me to reject several foundational assumptions in mainstream alignment and interpretability research. This does not imply that AI poses no risks (it implies nothing about...