The Turing machine solves computable problems, the oracle Turing machine solves undecidable problems, and the superinfinite iteration solves completeness problems. The corresponding structures in Bitcoin are: the script construction of TX and the nonce construction of Blocks belong to the category of computable Turing machines, the selection and confirmation of Blocks belong to the category of intuitionistic judgment problems of oracle Turing machines, and the accumulation of the longest chain's optimal iteration belongs to the category of completeness problems of super poor iterations. The internal existence determination problem of TX is equivalent to the existence determination of Block. The determination of a block depends on the relative determination beyond a single node within the distributed system. The accuracy of the intuitive judgment of the block derived from the convention belongs to the super finite iteration based on ordinal logic diagonal argumentation corresponding to the timestamp sequence.