Opening book details…
About this Computer Science article
Occam Bound on Lowest Complexity of Elements by Levin, Leonid A. is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Levin, Leonid A.
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0168-0072)
- Published
- 2016
- Field
- Computer Science (Physical Sciences)