A Turing Incomputable Coloring Function
Computational Complexity
2023-12-06 v1 Logic in Computer Science
Combinatorics
Logic
Abstract
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 coloring system. In our proof that generates the sequence, we use the notions of a chain and an unbounded sequence property, which resemble the methods of point set topology. From this sequence, we define a Turing incomputable coloring function.
Keywords
Cite
@article{arxiv.2312.02412,
title = {A Turing Incomputable Coloring Function},
author = {Michael Stephen Fiske},
journal= {arXiv preprint arXiv:2312.02412},
year = {2023}
}
Comments
6 pages