phenomenon · first seen 2 Nov 2026
turing completeness of neural networks
The property that iterated neural networks can simulate arbitrary Turing machines, establishing computational universality and hardness results.
Mentions per week
PapersCodeDiscussion
Earliest sources
- Iterated Narrow Networks: Turing Completeness at Width 4 on Convex Input Spaces and the Complexity of VerificationPapers · 2 Nov 2026 · Olivier Bournez, Johanne Cohen, Adrian Wurm
Latest sources
- Iterated Narrow Networks: Turing Completeness at Width 4 on Convex Input Spaces and the Complexity of VerificationPapers · 2 Nov 2026 · Olivier Bournez, Johanne Cohen, Adrian Wurm