Transcendental integer

Let \(M\) be a Turing machine that can be proven to halt with blank input in ZFC using less than \(2^{1000}\) symbols. If an integer \(n\) is always greater than or equal to the halting time of \(M\), then \(n\) is said to be a transcendental integer, as defined by Harvey Friedman.