Editing Talk:1266: Halting Problem
Please sign your posts with ~~~~ |
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 16: | Line 16: | ||
What is the joke here? What does "big picture" mean? [[Special:Contributions/62.209.198.2|62.209.198.2]] 16:33, 18 September 2013 (UTC) | What is the joke here? What does "big picture" mean? [[Special:Contributions/62.209.198.2|62.209.198.2]] 16:33, 18 September 2013 (UTC) | ||
:I believe it's related to the quote " In the long run we are all dead." by John Maynard Keynes. [[User:Osias|Osias]] ([[User talk:Osias|talk]]) 18:46, 18 September 2013 (UTC) | :I believe it's related to the quote " In the long run we are all dead." by John Maynard Keynes. [[User:Osias|Osias]] ([[User talk:Osias|talk]]) 18:46, 18 September 2013 (UTC) | ||
− | |||
Same kind of humor as in http://www.explainxkcd.com/wiki/index.php?title=221 [[Special:Contributions/176.67.13.14|176.67.13.14]] 18:47, 18 September 2013 (UTC) | Same kind of humor as in http://www.explainxkcd.com/wiki/index.php?title=221 [[Special:Contributions/176.67.13.14|176.67.13.14]] 18:47, 18 September 2013 (UTC) | ||
Line 39: | Line 38: | ||
: It won't work if your program is exit() or shutdownYourComputer(). :) --[[Special:Contributions/61.223.87.164|61.223.87.164]] 00:49, 28 September 2013 (UTC) | : It won't work if your program is exit() or shutdownYourComputer(). :) --[[Special:Contributions/61.223.87.164|61.223.87.164]] 00:49, 28 September 2013 (UTC) | ||
− | ::It will. We are talking about Turing machines. A Turing machine can stop itself, but it cannot stop the calling Turing machine. [[User:Xhfz|Xhfz]] ([[User talk:Xhfz|talk]]) 12:43, 7 October 2013 (UTC) | + | ::It will. We are talking about Turing machines. A Turing machine can stop itself, but it cannot stop the calling Turing machine. [[User:Xhfz|Xhfz]] ([[User talk:Xhfz|talk]]) 12:43, 7 October 2013 (UTC) |
:::Turing machines are known to be really poor at I/O. If you trace the shutdownYourComputer function, it actually instructs your {{w|Power_supply_unit_(computer)|power supply unit}} (ATX required, AT lacked such capability) to turn power down. Similarly, rebootYourComputer function instruct outside hardware - usually {{w|Northbridge_(computing)|north bridge}} - to send a reset signal on the {{w|Peripheral_Component_Interconnect|PCI bus}} (and presumably other busses), which will reset all devices and start {{w|Power-on_self-test|POST}}. Unlike Turing machines, virtualized OSs may be able to reboot host computer if the hypervisor is not coded correctly and allows I/O for hardware acceleration. -- [[User:Hkmaly|Hkmaly]] ([[User talk:Hkmaly|talk]]) 09:22, 16 October 2013 (UTC) | :::Turing machines are known to be really poor at I/O. If you trace the shutdownYourComputer function, it actually instructs your {{w|Power_supply_unit_(computer)|power supply unit}} (ATX required, AT lacked such capability) to turn power down. Similarly, rebootYourComputer function instruct outside hardware - usually {{w|Northbridge_(computing)|north bridge}} - to send a reset signal on the {{w|Peripheral_Component_Interconnect|PCI bus}} (and presumably other busses), which will reset all devices and start {{w|Power-on_self-test|POST}}. Unlike Turing machines, virtualized OSs may be able to reboot host computer if the hypervisor is not coded correctly and allows I/O for hardware acceleration. -- [[User:Hkmaly|Hkmaly]] ([[User talk:Hkmaly|talk]]) 09:22, 16 October 2013 (UTC) | ||
− | |||
− | |||
− | |||
; The halting problem for every input | ; The halting problem for every input | ||
The sentence in bold is false | The sentence in bold is false | ||
Line 58: | Line 54: | ||
Machine B determines if Y halts. And Y halts if machine X does not halt. If we had Turing machine A then we could build B. | Machine B determines if Y halts. And Y halts if machine X does not halt. If we had Turing machine A then we could build B. | ||
[[User:Xhfz|Xhfz]] ([[User talk:Xhfz|talk]]) 17:53, 18 October 2013 (UTC) | [[User:Xhfz|Xhfz]] ([[User talk:Xhfz|talk]]) 17:53, 18 October 2013 (UTC) | ||
− | |||
− | |||
; Karl Popper | ; Karl Popper | ||
I think that the title text is a direct reference to Karl Popper's falsifiability argument, since this is one of the most common example of a non-falsifiable statement. [[User:Bonob|Bonob]] ([[User talk:Bonob|talk]]) 19:01, 18 October 2013 (UTC) | I think that the title text is a direct reference to Karl Popper's falsifiability argument, since this is one of the most common example of a non-falsifiable statement. [[User:Bonob|Bonob]] ([[User talk:Bonob|talk]]) 19:01, 18 October 2013 (UTC) | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− |