A Turing Incomputable Coloring Function

MaRDI QIDQ6462189zbMATH OpenFDO

Authors Michael Stephen Fiske

Publication date 4 December 2023

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

This page was built for publication: A Turing Incomputable Coloring Function

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