2

Can anyone please give me a proof of K-Complexity is unsolvable using reductions.

eg:

PCP(2) <= PCP(3)

I can prove that PCP(3) is unsolvable by reducing to PCP(2) (by mapping every instance).

I am not sure how to reduce K-Complexity to another known undecidable problem (like halting problem). i.e., X <= K-Complexity

Can you please provide me proof for that? At least provide me some idea (X ).

Thanks in Advance

Community
  • 1
  • 1
Krishna Chikkala
  • 91
  • 1
  • 10
  • 2
    This question would find willing and able answerers over at [TCS.SE](http://cstheory.stackexchange.com/). – Iwillnotexist Idonotexist Apr 26 '15 at 04:33
  • 1
    I'm voting to close this question as off-topic because it is best suited for `cstheory.stackexchange.com`. – Am_I_Helpful Apr 26 '15 at 04:34
  • Thank you.. will wait for sometime and post the question at SE. – Krishna Chikkala Apr 26 '15 at 04:47
  • By K-complexity do you mean the set of non-Random numbers? Because this is a r.e. but simple set, hence not complete, and there is no reduction from a complete problem to it. – Andrea Asperti Feb 28 '17 at 20:36
  • @AndreaAsperti I really don't understand what you are asking. But this question is answered here- [link] (http://cstheory.stackexchange.com/questions/31278/proof-for-kolmogorov-complexity-is-uncomputable-using-reductions/31305?noredirect=1#comment71359_31305) – Krishna Chikkala Mar 01 '17 at 21:41
  • Yes, precisely, you can find a couple of proofs in Odifreddi's book "Classical Recursion Theory", Studies in Logic and the Foundations of Mathematics, vol 125. – Andrea Asperti Mar 02 '17 at 07:15

0 Answers0