筆記與流年

We consider the relative computational power between the base-two expansion of \Omega and the halting problem by imposing the restriction to finite size on both the problems. It is known that the base-two expansion of \Omega and the halting problem are Turing equivalent. We thus consider an elaboration of the Turing equivalence in a certain manner.