The church kleene ordinal is defined as the first ordinal that cannot be computed.
But how should we imagine this ordinal? What is the "limit process" that leads to it?
$\omega_1^{CK}$ is also the first uncomputable ordinal. So if $f(n)$ is the largest ordinal defined by a length $n$ turingmachine. Then $\omega_1^{CK}$ is $$\lim_{n\to\omega} f(n)$$
Copyright © 2021 JogjaFile Inc.
$\omega_1^{CK}$ is also the first uncomputable ordinal. So if $f(n)$ is the largest ordinal defined by a length $n$ turingmachine. Then $\omega_1^{CK}$ is $$\lim_{n\to\omega} f(n)$$