Jump to content

Few confusions about halting problem is unsolvable proof-:


shivajikobardan

Recommended Posts

xFVXel6_szTL_WVir-dz4SpFIGkHqMY9428mA3HRY2Nl06Ez9Wt9N3RZ8U0Jmsshwnl7ekEQX31ccWBXBNW5XUhRwVQafqZOPHpmy3fY4L94b4UmqGR-N7IIO8Ep1wpWg4BmDebD

How can same machine take same machine as input(is it same machine taking encoding of itself as input—if that’s the case, what does that means some examples to understand this)?  (in Universal Turing Machine, i know it was possible). What does that even mean here?

 

I feel like adding a turing machine flipper is like cheating and should not be allowed as well.

 

Q52OnluXaJhBGPUQEcMzbJlS5ooxohC_Pn_D_fUq_BUCmRyfuE1d4XRY8KwEBIkqzy8zJBiaZT-VGQlqQQKQ0Qdiw0VD0v2pxHhu4WVTfGP-7_bqzTG4pnjhHJfXoMN7NC4Adplg

 

Link to comment
Share on other sites

  • 10 months later...

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.