scientific article; zbMATH DE number 3645068

MaRDI QIDQ3050409zbMATH OpenFDO

Authors Victor L. Bennison

Publication date 1977

zbMATH Keywords

undecidabilityrecursively enumerable setabstract computational complexitycomputable sequence of partial recursive functionsmeasure-independent propertiespseudo-complexity sequences

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3050409)