An undecidable property of recurrent double sequences

DOI10.1215/00294527-2008-004zbMath1168.03032OpenAlexW1977385490MaRDI 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

undecidabilityTuring machinefinite algebrarecurrent sequence

Mathematics Subject Classification ID

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

Related Items (5)

A two-valued recurrent double sequence that is not automatic ⋮ The Thue-Morse-Pascal double sequence and similar structures ⋮ RECURRENT TWO-DIMENSIONAL SEQUENCES GENERATED BY HOMOMORPHISMS OF FINITE ABELIAN p-GROUPS WITH PERIODIC INITIAL CONDITIONS ⋮ RECURRENT DOUBLE SEQUENCES THAT CAN BE PRODUCED BY CONTEXT-FREE SUBSTITUTIONS ⋮ Self-similar carpets over finite fields

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