FIT2014 @ W9 - F2 by Wong Kok Sheik https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n en-us 2023-09-19 04:30:23 UTC 2023-09-19 05:59:48 UTC hello@padlet.com https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710155893 whats the difference between M and M'

]]> 2023-09-19 05:26:19 UTC https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710155893 https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710157534
So we can say that M halts on input M if and only if M' halts on any input ? and with this we can say that halt for any input is undecidable ?]]> 2023-09-19 05:27:29 UTC https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710157534 https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710167615 I don't understand how running M on M suddenly proves Half for Input Zero]]> 2023-09-19 05:35:19 UTC https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710167615 So when M be the input for itself for a HP or a DHP, for every no input it is possible for the Turing Machine to loop making it undecidable. Is my logic right? https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710169539
In the case of proving HFIZ, does the mapping of DHP to HFIZ mean we are trying to run HFIZ with DHP as the input?]]> 2023-09-19 05:36:49 UTC https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710169539 https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710176043 Isn't the process of mapping the inputs this way just assuming that inputs of HFIZ will lead to the same result as DHP instead of actually proving it?]]> 2023-09-19 05:42:09 UTC https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710176043 https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710177029 So the input for DHP, M which is a TM is modified to M' to prove HFIZ is undecidable ]]> 2023-09-19 05:43:02 UTC https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710177029 https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710182124 Is it because we don know if M’ will halts on any input so its undecidable]]> 2023-09-19 05:47:18 UTC https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710182124 https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710193671 Can you explain again why the first one is undecidable? (Question: Input turing machine P and string x, does P accept x )]]> 2023-09-19 05:56:34 UTC https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710193671 https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710194242 Can you explain why the question "does P accept X " is undecidable ? is it because we dont know if it can halt or not because there might be a loop in the middle ?]]> 2023-09-19 05:57:02 UTC https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710194242 https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710195588 Why does switching accept and reject gives a sometimes halt

So for this does this refer to the complement ]]> 2023-09-19 05:57:58 UTC https://padlet.com/wongkoksheik/9drvlf7y6yg2ws1n/wish/2710195588