Abstract
In the literature, prefix Kolmogorov complexity is defined either in terms of self-delimiting Turing machines or in terms of partial recursive prefix functions. These notions of prefix Kolmogorov complexity are equivalent because, as Chaitin showed, every partial recursive prefix function can be simulated by a self-delimiting Turing machine. However, the simulation given by Chaitin's construction is not efficient, and so questions regarding the time-bounded equivalence of these notions remained unresolved. Here we closely examine these questions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
