Turing Says No!

Jun. 8th, 2012 08:59 pm
morwen: (Default)
[personal profile] morwen
Was explaining how figuring out full dependency information in a system where you can run arbitrary code is hard to the point of impossibility. Think it is best summed up with this image, what I made in gimp.



Beneath it should of course be a proof of the undecidability of the halting problem.
Tags:
  • Add Memory
  • Share This Entry
This account has disabled anonymous posting.
If you don't have an account you can create one now.
No Subject Icon Selected
More info about formatting
 
Notice: This account is set to log the IP addresses of everyone who comments.
Links will be displayed as unclickable URLs to help prevent spam.

Profile

morwen: (Default)
Abigail Brady

May 2017

S M T W T F S
 123456
78910111213
14151617181920
21222324252627
282930 31   

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags
Page generated Aug. 8th, 2025 07:31 am
Powered by Dreamwidth Studios