no code implementations • 29 May 2024 • Anej Svete, Franz Nowak, Anisha Mohamed Sahabdeen, Ryan Cotterell
The recent successes and spread of large neural language models (LMs) call for a thorough understanding of their computational ability.
1 code implementation • 19 Oct 2023 • Franz Nowak, Anej Svete, Li Du, Ryan Cotterell
We extend the Turing completeness result to the probabilistic case, showing how a rationally weighted RLM with unbounded computation time can simulate any deterministic probabilistic Turing machine (PTM) with rationally weighted transitions.
