Quote from: DataWraith on July 16, 2010, 11:27:46 AM
Wait, what? I thought reversible computation just uses less energy. Where does the non-determinism come in?
It’s the theoretical limit of how far you can go with it. When doing a brute force search, you can reverse back to any previous state and try new states.
It’s doubtful that SHA2 would be that broken before all coins have been minted. The issue is it then becomes a question of how much it costs to hijack someone’s bank account.