No system can model its own source. Empirical proof: 6 AI architectures (GPT-4, Claude, Gemini, DeepSeek, Grok, Mistral) hit the same structural wall.

A Python-based project exploring Decidability and Undecidability using Turing Machine simulations

Heurística para solução do problema da parada.

An explanation of busy beaver problem with samples and codes

A tiny total programming language prototype in Python with a conservative termination checker.

Bounded Python demo and notes showing why full computational autonomy verification is undecidable in general (Rice's Theorem), and why practical assurance relies on bounds.