Michael Machtey A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes [Citation Graph (0, 0)][DBLP] FOCS, 1973, pp:181-189 [Conf]
Michael Machtey Helping and the Meet of Pairs of Honest Subrecursive Classes [Citation Graph (0, 0)][DBLP] Information and Control, 1975, v:28, n:1, pp:76-89 [Journal]
Paul Chew, Michael Machtey A Note on Structure and Looking Back Applied to the Complexity of Computable Functions. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1981, v:22, n:1, pp:53-59 [Journal]
Michael Machtey Augmented Loop Languages and Classes of Computables Functions. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1972, v:6, n:6, pp:603-624 [Journal]
Michael Machtey, Paul Young Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:442-453 [Journal]