On Splits of Computably Enumerable Sets - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Peter A. Cholak. On Splits of Computably Enumerable Sets. In Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond, editors, Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Volume 10010 of Lecture Notes in Computer Science, pages 521-535, Springer, 2017. [doi]

The following publications are possibly variants of this publication:

Isomorphisms of splits of computably enumerable setsPeter Cholak, Leo Harrington. JSYML, 68(3):1044-1064, 2003.

Definable encodings in the computably enumerable setsPeter Cholak, Leo Harrington. bsl, 6(2):185-196, 2000. [doi]

The Complexity of Orbits of Computably Enumerable SetsPeter Cholak, Rodney G. Downey, Leo Harrington. bsl, 14(1):69-87, 2008. [doi]

runs on WebDSL