User blog comment:C7X/CNF Comparison Algorithm/@comment-32213734-20200106184503/@comment-37485018-20200107020339

If an algorithm requires an encoding to formal strings, then is it possible to define them like this (it will no longer be computable, however):

\(T_0=\{0\} \\ T_{n+1}=\{\gamma+\delta,\omega^{\gamma}:\gamma,\delta\in C_n\land \delta<\gamma\} \\ T=\bigcup_{n<\omega}T_n\)

This uses \(<\) in the definition of the set of terms however, but this is possible (however it isn't computable).