A Turing Incomputable Coloring Function

Michael Stephen Fiske

This paper describes a sequence of natural numbers that grows faster than any Turing computable function. This sequence is generated from a version of the tiling problem, called a…