Lecerf, Yves Machines de Turing reversibles. Recursive insolubilite en \(n\in N\) de l’équation \(u =\theta^ n u\), ou \(\theta\) est un’isomorphisme de codes’. (French) Zbl 0192.06901 C. R. Acad. Sci., Paris 257, 1597-2600 (1963). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 20 Documents Keywords:recursion theory, constructive mathematics PDFBibTeX XMLCite \textit{Y. Lecerf}, C. R. Acad. Sci., Paris 257, 1597--2600 (1963; Zbl 0192.06901)