arXiv (All)
open access
Interpretability for Turing Machines
We show that susceptibilities, an interpretability technique developed for neural networks, can identify the presence of algorithmic structure in Turing machines by probing the local loss landscape of a learning problem for noisy Turing machines introduced by Murfet and Troiani (arXiv:2504.08075). W
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Interpretability of Artificial Neural Networks: A Survey#686515
- Faultless: A Program Equivalence Technique for Validating and Evaluating Neural Decompilers#1119162
- Faultless: A Program Equivalence Technique for Validating and Evaluating Neural Decompilers#1108843
- OPEN-1B: A Fully Auditable Training Run#1123745
- OPEN-1B: A Fully Auditable Training Run#919384
Record · ID 927928
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive