z-logo
open-access-imgOpen Access
The Besicovitch-Stability of Noisy Tilings is Undecidable
Author(s) -
Léo Gayral
Publication year - 2021
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - undecidable problem , stability (learning theory) , computer science , embedding , turing , aperiodic graph , turing machine , theoretical computer science , description number , discrete mathematics , combinatorics , mathematics , algorithm , artificial intelligence , universal turing machine , decidability , programming language , computation , machine learning

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom