Fagin's R中k的发现定理24
Finding of k in Fagin's R. Theorem 24
摘要：
利用解析多逻辑表示和非确定图灵机，证明了多项式时间复杂度的确定图灵计数机算法可降为非确定图灵计数机的线性时间复杂度算法.进一步证明了字符串识别的多项式时间复杂度通过从确定性转换到非确定性图灵机而降低到线性时间复杂度的存在性，这意味着P等于NP.利用高阶逻辑的分析生成函数求Fagin的R中的k值。定理24.
英文摘要：
By using of analytical multi-logic expresses in conjunction with non-deterministic Turing machine the proposition was proved that algorithm of deterministic Turing counter machine of polynomial time complexity can be decreased to the algorithm of linear time complexity in non-deterministic Turing counter machine. Furthermore, it was shown that existence of reduction of polynomial time complexity to the linear time complexity by switching from deterministic to non-deterministic Turing machine for string recognition imply P equals to NP. Analytical generation functions of higher order logic were used for finding of k value in Fagin's R. Theorem 24.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
