Computability of Countable Subshifts

DOI10.1007/978-3-642-13962-8_10zbMath1285.03054OpenAlexW1589032592MaRDI QIDQ3576194

Ferit Toska, Ali Dashti, Sebastian Wyman, Douglas Cenzer

Publication date: 29 July 2010

Published in: Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13962-8_10

zbMATH Keywords

symbolic dynamicscomputability\(\Pi^0_1\) classes

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78)

Related Items (5)

Conservatively Approximable Functions ⋮ Cototal enumeration degrees and their applications to effective mathematics ⋮ Turing degree spectra of minimal subshifts ⋮ $\it \Pi^0_1$ Sets and Tilings ⋮ Computability of countable subshifts in one dimension

This page was built for publication: Computability of Countable Subshifts