Information and ControlVolume 39, Issue 2, November 1978, Pages 143-148Information and Cont...A characterization of the recursiveness of an m-adic probabilistic languageAuthor links open overlay panelH.P. Edmundson, Immanuel I. TungShow moreShareCitehttps://doi.org/10.1016/S0019-9958(78)90809-4Get rights and contentUnder an Elsevier user licenseopen archiveIt is shown that the language accepted by the m-adic two-state probabilistic acceptor at a given cut-point is a recursive language if and only if the cut-point is a Turing-computable real number.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1978 Published by Elsevier Inc.