Browsing Theses and Dissertations by Subject "Kolmogorov complexity"

Sort by: Order: Results:

  • Teutsch, Jason Richmond ([Bloomington, Ind.] : Indiana University, 2010-06-01)
    It is a basic fact that, given a computer language and a computable integer function, there exists a shortest program in that language which computes the desired function. Once a programmer establishes the correctness of ...

Search IUScholarWorks

Advanced Search


My Account