computation theory - Kolmogorov complexity is uncomputable using reductions -


can please give me proof of k-complexity unsolvable using reductions.

eg:

pcp(2) <= pcp(3)

i can prove pcp(3) unsolvable reducing pcp(2) (by mapping every instance).

i not sure how reduce k-complexity known undecidable problem (like halting problem). i.e., x <= k-complexity

can please provide me proof that? @ least provide me idea (x ).

thanks in advance


Comments

Popular posts from this blog

asp.net mvc - SSO between MVCForum and Umbraco7 -

Python Tkinter keyboard using bind -

ubuntu - Selenium Node Not Connecting to Hub, Not Opening Port -