Robert E. Byerly

According to our database, Robert E. Byerly authored at least 7 papers between 1982 and 2003.

Collaborative distances:

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

2003

Observability of permutations, and stream ciphers.

Robert E. Byerly, Lance D. Drager, Jeffrey M. Lee

IEEE Trans. Inf. Theory, 2003

2001

Cleavability in Ordered Spaces.

Harold Bennett, Robert E. Byerly, David Lutzer

Order, 2001

1984

Definability of Recursively Enumerable Sets in Abstract Computational Complexity Theory.

Robert E. Byerly

Math. Log. Q., 1984

Some Properties of Invariant Sets.

Robert E. Byerly

J. Symb. Log., 1984

1983

Definability of R. E. Sets in a Class of Recursion Theoretic Structures.

Robert E. Byerly

J. Symb. Log., 1983

1982

Recursion Theory and the Lambda-Calculus.

Robert E. Byerly

J. Symb. Log., 1982

An Invariance Notion in Recursion Theory.

Robert E. Byerly

J. Symb. Log., 1982