DOI10.1215/00294527-2008-004zbMath1168.03032MaRDI QIDQ929632
Mihai Prunescu
Publication date: 18 June 2008 Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave) Full work available at URL: https://doi.org/10.1215/00294527-2008-004
zbMATH Keywords
undecidability; Turing machine; finite algebra; recurrent sequence
Mathematics Subject Classification ID
03D35: Undecidability and degrees of sets of sentences
11B37: Recurrences