Turing's paper on computable numbers is known as the first paper in the computer industry, ushering in the era of designing computers using Turing machines as abstract models. But in this era, Turing machines are more than capable of being used as deterministic computing tools. But it is completely insufficient to solve unpredictable adaptive complex systems. And G ö del also proved that any formal system containing computation is incomplete. Turing and Church, as a pair of teachers and students, established computable models using mechanized/deterministic formal system abstractions in two articles on computability: Lamda calculus and Turing machine. But at this time, in 1937/1938, Turing, under the leadership of Church, was pursuing a PhD at Princeton University. The problem to be solved in his doctoral thesis was how to construct a methodology for constructing a complete system based on the formal system of G ö del's incompleteness theorem. It was also a step forward from Turing and Church's Turing machine and Lambda calculus models, which only solved computable problems, to solve the problem of decidability. Qiu Qi guided Turing in his doctoral thesis "Logic Systems Based on Ordinals", which brought a complete methodology: introducing the oracle Turing machine and using the technique of Transfinite to construct an infinitely approaching complete system. And Satoshi Nakamoto's craft of constructing Bitcoin is this craft. Each block has an assumption of the same proposition, which is the longest chain principle. The Turing degree (confidence) of the transaction existence system in each block will increase with the increase of subsequent guided blocks. Whether the transactions of each block are 100% confirmed depends on the growth of the Transfinite mode, where each block follows the longest chain one by one.