Switch to: References

Add citations

You must login to add citations.
  1. Kolmogorov Complexity and Computably Enumerable Sets.George Barmpalias & Angsheng Li - 2013 - Annals of Pure and Applied Logic 164 (12):1187-1200.