3 ms·
But wouldn't Turning completeness allow you to construct any computations, including the ones that will finish operations in specific limited steps?
by NL807 3y ago
But wouldn't Turning completeness allow you to construct any computations, including the ones that will finish operations in specific limited steps?
- kuhewa 3y agoSo if you know how to construct the missing oscillator, great, you can simulate it in GoL run on your GoL-TM (just slower than if you do it on hardware). That doesn't help discovering the unknown oscillator. As an aside, years into the use of computers to search for oscillators, humans were still beating machines to the punch in discovery of some of the unknown period oscillators, as the paper details.
- mmis1000 3y agoNo, your computer is Turning completeness. But it does not mean it will be able to encode a giant AV1 video in a night without dedicated hardware. Although it will do it eventually (probably a week or so).
- everforward 3y agoThis was my thought. It would imply that a Turing-complete machine should be able to solve NP problems in O(1) time.
- NL807 3y agoAh yea, good point!