An undecidable property of recurrent double sequences

DOI10.1215/00294527-2008-004MaRDI QIDQ929632zbMATH OpenOpenAlexFDO

Authors 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

Turing machineundecidabilityfinite algebrarecurrent sequence

Mathematics Subject Classification ID

Recurrences (11B37) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• A two-valued recurrent double sequence that is not automatic
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
• The undecidability of the definability of principal subcongruences
• Some undecidability results in strong algebraic languages
• THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE

Cited in

(5)

• Recurrent two-dimensional sequences generated by homomorphisms of finite abelian \(p\)-groups with periodic initial conditions
• A two-valued recurrent double sequence that is not automatic
• RECURRENT DOUBLE SEQUENCES THAT CAN BE PRODUCED BY CONTEXT-FREE SUBSTITUTIONS
• The Thue-Morse-Pascal double sequence and similar structures
• Self-similar carpets over finite fields

This page was built for publication: An undecidable property of recurrent double sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q929632)