This article summarizes my book on The Self-Defining Universe, which focuses on how the universe can exist without an external runner – a fully self-contained universe that “runs itself.”
NOTE: This book is part 2 – following on my more general book on the Mathematical Foundations of Self-Referential Systems.… Read More “The Self-Defining Universe”
This article is about a new kind of simple computational rule (“LACE rules” running on LACE, the Link Automata Computing Engine platform) which, when applied locally on a grid of cells, demonstrates fascinating emergent “artificial life” behavior.
For readers familiar with the Game of Life (GOL), this is a next-level class of cellular automata that utilizes neighborhood topology — the state of the grid is a function of both cell states and their connectivity (links).… Read More “Introducing LACE – A New Kind of Cellular Automata”
Large language models exhibit a critical limitation: they cannot reliably evaluate their own outputs within the same conversational context where those outputs were generated. Recent research demonstrates that when AI systems attempt to check their own reasoning, they confirm their initial responses over 90% of the time regardless of correctness—a phenomenon researchers term “intrinsic self-correction failure.”… Read More “Why AI Systems Can’t Catch Their Own Mistakes – And What to Do About It”