James C. Owings Jr.

According to our database, James C. Owings Jr. authored at least 7 papers between 1967 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2000

A Sum of Chebyshev Inequalities: 10687.

James C. Owings Jr., Jeremy E. Dawson, Robin J. Chapman, Darryl K. Nester, Robert A. Agnew, John Beebee, David Callan, R. Garcia-Pelayo, V. Hernandez, J. Martin, J. Hickman, D. Jones, S. S. Kim, Olaf Krafft, Martin Schaefer, G. Letac, John H. Lindsey II, O. P. Lossers, K. Poelladennou, K. Schilling, M. Shemesh

Am. Math. Mon., 2000

1976

The Inequivalence of Two Well-Known Notions of Randomness for Binary Sequences.

Thomas Herzog, James C. Owings Jr.

Math. Log. Q., 1976

1973

A class of universal linear bounded automata.

Eliot D. Feldman, James C. Owings Jr.

Inf. Sci., 1973

1971

A Splitting Theorem for Simple pi¹₁ Sets.

James C. Owings Jr.

J. Symb. Log., 1971

1970

The Meta-R.E. Sets, but Not the pi¹₁ Sets, Can Be Enumerated Without Repetition.

James C. Owings Jr.

J. Symb. Log., 1970

1969

pi¹₁ Sets, omega-Sets, and Metacompleteness.

James C. Owings Jr.

J. Symb. Log., 1969

1967

Recursion, Metarecursion, and Inclusion.

James C. Owings Jr.

J. Symb. Log., 1967