HPMOR is a really great book.
https://www.fanfiction.net/s/5782108/17/Harry-Potter-and-the...
Harry Potter and the Natural 20 is also highly enjoyable.
How? And I found it better than the original at the very least ;)
I do like his choice not to give the idiot ball to anyone.
(Please look up the technical terms on tvtropes. But only, if you have an afternoon to burn.)
The space of possible stable outcomes is much larger than just the ones carrying the outcome of the computation.
"I am the Eschaton; I am not your God. I am descended from you, and exist in your future. Thou shalt not violate causality within my historic light cone. Or else."
I wonder what the time-energy-complexity trade-offs are?
As an aside, I would gladly pay someone to walk me through the math and physics sometime. (Any grad students in Atlanta are more than welcome to take me up on that offer... I might even try Skype.)
Shows that (with or without quantum computing) you can do all of PSPACE using a CTC (in polynomial time) and no more.
So for a time-travel computer to give P=NP or P=O(1), it would have to violate Deutsch's causality criterion. I have almost zero knowledge of either field, but it sounds to me like it makes Deutsch's model more plausible.
https://en.wikipedia.org/wiki/NP_(complexity)#Relationship_t...
A CTC is effectively a computer that can process a loop instantly, regardless of how complicated it is. Given that, we could design an AI machine that could analyse an arbitrary amount of data in any depth without regard to how long it'll take. More than that, everything happens in one 'tick' of whatever is controlling the CTC, so there aren't any issues around asynchronous processing. It just 'goes away'. Such a machine would never have to wait for another process to finish. Strong AI would be pretty much a certainty - we'd be able to brute force any problem.
Granted, I'm way way out of my depth here. I have a Ph.D. in physics but I studied nonlinear oscillators, relating them to problems in neuroscience.
http://wiki.lesswrong.com/wiki/AIXI
So you could use the time loop to run through this algorithm.
But what's this about predictions? Why predict when you have a time machine? All you really need is a reward function and this algorithm:
- Get a message from the future with its best-ever reward and how it achieved it.
- Try something else
- When you get to the future, see whether you've done better than the best ever. If so, replace the best ever.
- With each iteration keep a count. If you've reached some maximum number of tries without improving the best score ever, do the best strategy one last time and quit.
It might be tricky figuring out the best span of time to use, and whether you can do mini-loops within bigger loops somehow.
Or try simulating a human brain.
As well as performing arbitrary computations in one tick, we could also keep a CTC going as a "reset button": whenever we realise that an incorrect/sub-optimal decision has been made, we can go back to when we started.
This lets us 'brute force' our real-world interactions (ie. our IO), as well as "merely" gaining an infinite computing speed-up.
This could be exploited by something similar to the "Success Story Algorithm" http://www.idsia.ch/~juergen/directsearch/node13.html . The CTC-AI would some way of "scoring" the world (ie. a fitness function), some probability of modifying its decision-making policy, and some non-zero probability of resetting the world. If the reset probability is anti-correlated to the world's score, worlds which score higher over time are more likely, hence the machine's decisions are more likely to increase the score than decrease it, hence the policy is more likely to improve over time.
But seriously, the problem with this is that it assumes that the only resolution to the CTC is that the AI generator tries another program.
Another use for backward time travel is data compression. To compress a file, you simply replace its contents with a note saying when you did this. When you later want the file, just pop back to that time and get it.
This also greatly simplifies backup systems.
That's not actual decryption. You can do the same thing without time travel too, e.g by hitting the guy.
The key is very short, only five letters, so it should be pretty trivial to brute force. Can you tell me what the message is?
That seems like an understatement if I'm understanding it correctly.
Imagine you have a "time machine" and you want to solve some arbitrary computable problem. You try a prospective solution and see if it's correct. If not, you send the next prospective solution back to be tried on the next go around the time loop. Once you arrive at the correct solution, you send that same solution back so that the iteration stops there. Then the loop repeats indefinitely with the correct solution so that the probability of exiting the loop at the correct solution approaches infinity.
It would literally be the end of the world as we know it. P=NP. Forget about quantum cryptography, that would break all public key cryptography, all cryptographic hash functions. It would obsolete algorithmic complexity theory by effectively turning every finite space algorithm into an O(1) algorithm. It would probably bring Strong AI.
But it still couldn't break a one-time pad.