= 27d567bc2d48d9f40e9ccc20ea370b15)
khafra comments on MIRI's 2013 Summer Matching Challenge - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (122)
Donated 0.9766578425 bitcoins, a number I chose since that's Chaitin's Omega for the shortest FAI.
(Consults Inverse Chaitin function in Wolfram Alpha.)
Actually, is there a definition of Chaitin's Omega for particular programs? I thought it was just for universal Turing machines, or program classes with a measure on them anyway.
Whoops, that's right. I, ah, may have just unleashed a trolly AI.
Yes, you can take the probability that they will halt given a random input. This is analogous to the case of a universal Turing machine, since the way we ask it to simulate a random Turing machine is by giving it a random input string.
Dangit, I should've said "the FAI is Turing-complete, you can carry out arbitrary computations simply by running it in carefully selected universes."
With a five orders of magnitude improvement in timing, I could be witty.
Is that the probability that the shortest FAI halts given random input?
Thanks!