MathDB1 problem
- 0 votes0 replies0 views
Universality of the self-replication equational systems in Turing-complete languages
Universality conjecture. The same result should hold for arbitrary programming languages: as soon as a language is Turing-complete, it should interpret the authors' logical systems…