Donald A. Alton

According to our database, Donald A. Alton authored at least 8 papers between 1971 and 1977.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of six.

1977

"Natural" Complexity Measures and a Subrecursive Speed-up Theorem.

Donald A. Alton

Proceedings of the Information Processing, 1977

"Natural" Complexity Measures and Time versus Memory: Some Definitional Proposals.

Donald A. Alton

Proceedings of the Automata, 1977

1976

Diversity of Speed-Ups and Embeddability in Computational Complexity.

Donald A. Alton

J. Symb. Log., 1976

Nonexistence of Program Optimizers in Several Abstract Settings.

Donald A. Alton

J. Comput. Syst. Sci., 1976

1975

Embedding relations in the lattice of recursively enumerable sets.

Donald A. Alton

Arch. Math. Log., 1975

A characterization of<i>R</i>-maximal sets.

Donald A. Alton

Arch. Math. Log., 1975

1974

Non-existence of program optimizers in an abstract setting.

Donald A. Alton, John L. Lowther

Proceedings of the Programming Symposium, 1974

1971

Recursively Enumerable Sets Which are Uniform for Finite Extensions.

Donald A. Alton

J. Symb. Log., 1971