_n^p和■_n^p的递归可表示性

The Recursively Representative Character of _n^p and ■_n^p

通过对△np与△np(A)两类复杂性语言中的多项式图灵完全集之间关系的研究,证明了pn、■pn等计算复杂性语言类的递归可表示性。

Abstract： The Recursively Representative Character of L^pn and H^pn are proved in this article based on the studies of the relationship between the polynomial Turing complete sets in △n （A） and △n^P （A） .