The info on wikipedia is ok. This MIRI interview with Mike Frank provides a good high level overview. Frank’s various publications go into more details. “Physical Limits of Computing” by M Frank in particular is pretty good.
There have been a few discussions here on LW about some of the implications of reversible computing for the far future. Not all algorithms can take advantage of reversibility, but it looks like reversible simulations in general are feasible if they unwind time, and in particular monte carlo simulation algorithms could recycle entropy bits without unwinding time.
The info on wikipedia is ok. This MIRI interview with Mike Frank provides a good high level overview. Frank’s various publications go into more details. “Physical Limits of Computing” by M Frank in particular is pretty good.
There have been a few discussions here on LW about some of the implications of reversible computing for the far future. Not all algorithms can take advantage of reversibility, but it looks like reversible simulations in general are feasible if they unwind time, and in particular monte carlo simulation algorithms could recycle entropy bits without unwinding time.
Thanks, I’ll check it out.