A NOTION OF HELPING AND PSEUDO-COMPLEMENTATION IN LATTICES OF HONEST SUBRECURSIVE CLASSES.MACHTEY M.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 181-189; BIBL. 7 REF.Conference Paper

HELPING AND THE MEET OF PAIRS OF HONEST SUBRECURSIVE CLASSES.MACHTEY M.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 28; NO 1; PP. 76-89; BIBL. 8 REF.Article

MINIMAL PAIRS OF POLYNOMIAL DEGREES WITH SUBEXPONENTIAL COMPLEXITY.MACHTEY M.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 1; PP. 73-76; BIBL. 5 REF.Article

ON THE DENSITY OF HONEST SUBRECURSIVE CLASSES.MACHTEY M.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 2; PP. 183-199; BIBL. 14 REF.Article

AUGMENTED LOOP LANGUAGES AND CLASSES OF COMPUTABLE FUNCTIONSMACHTEY M.1972; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1972; VOL. 6; NO 6; PP. 603-623; BIBL. 1 P.Serial Issue

REMARKS ON RECURSION VERSUS DIAGONALIZATION AND EXPONENTIALLY DIFFICULT PROBLEMSMACHTEY M; YOUNG P.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 3; PP. 442-453; BIBL. 9 REF.Article

A NOTE ON STRUCTURE AND LOOKING BACK APPLIED TO THE RELATIVE COMPLEXITY OF COMPUTABLE FUNCTIONSCHEW P; MACHTEY M.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 1; PP. 53-59; BIBL. 2 REF.Article