Computational problems are classified into computable and uncomputable problems.If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable.Turing machines can execute any algorithm therefore every computable problem is Turing computable.There are some variants of Turing machine that appear computationally more powerful but all these variants have been proven equally powerful.The main objective of this work is to revisit and examine the computational power of different variants of Turing machines at very fine-grain level.We achieve this objective by constructing a transform technique for Turing computable problems that transforms computable problems into another type of problems, and then we try to compute the transformed problems through different variants of Turing machine.This paper shows the existence of a realizable computational scheme that can establish a framework to analyze computational characteristics of different variants of Turing machine at infinitesimal scale.

翻译：计算问题被分为可计算问题与不可计算问题。若存在有效过程（算法）能求解某问题，则该问题为可计算的，否则为不可计算的。图灵机可执行任意算法，因而所有可计算问题均为图灵可计算的。存在一些看似具有更强计算能力的图灵机变体，但已被证明所有变体在计算能力上等价。本文的主要目标是在极细粒度层面重新审视并检验不同图灵机变体的计算能力。我们通过构建一种面向图灵可计算问题的变换技术来实现该目标，该技术将可计算问题转化为另一类问题，进而尝试通过不同图灵机变体计算转换后的问题。本文证明了一种可实现的计算方案的存在性，该方案能建立框架，在无穷小尺度上分析不同图灵机变体的计算特性。