Recurrent neural language models with rational weights and unbounded computation time can simulate any deterministic probabilistic Turing machine with rationally weighted transitions.
