Diagonalizations over Polynomial Time Computable Sets


raet. A formal notion of diagonalization is developed which allows to enforce properties that are related to the class of polynomial timecomputable sets (the class of polynomial time computable functions respectively), like, e.g., p-immunity. It is shown that there are sets-called p-generiowhich have all properties enforceable by such diagonalizations. We… (More)
DOI: 10.1016/0304-3975(87)90053-3


Cite this paper

@article{AmbosSpies1987DiagonalizationsOP, title={Diagonalizations over Polynomial Time Computable Sets}, author={Klaus Ambos-Spies and Hans Fleischhack and Hagen Huwig}, journal={Theor. Comput. Sci.}, year={1987}, volume={51}, pages={177-204} }