arXiv (All)
open access
Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings
The purpose of this article is to study the algorithmic complexity of the Besicovitch stability of noisy subshifts of finite type, a notion studied in a previous article. First, we exhibit an unstable aperiodic tiling, and then see how it can serve as a building block to implement several reductions
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A polynomial time algorithm for almost bounded denumerant#612421
- A polynomial time algorithm for almost bounded denumerant#610944
- Consistency of Lloyd's Algorithm Under Perturbations#174013
- Consistency of Lloyd's Algorithm Under Perturbations#173435
- Consistency of Lloyd's Algorithm Under Perturbations#173185
Record · ID 996848
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive