3 ms·
Ok, but unless you stick with some fixed resource limit N forever, the problem is undecidable again. I suppose we could pick a very large resource number N (al
by Nevermark 4y ago
Ok, but unless you stick with some fixed resource limit N forever, the problem is undecidable again.
I suppose we could pick a very large resource number N (allocatable between time and memory space?) and agree that we will create a large body of math and algorithms with the assumption of that limit, so all our theorems and programs within that finite math area are consistent.
But a great deal of math would have to be reconsidered every time N was increased.
- wizeman 4y ago> Ok, but unless you stick with some fixed resource limit N forever, the problem is undecidable again. Why do you believe that? The existence of the cycle detection algorithms that I mentioned earlier don't assume any particular number N and yet they prove that the problem is decidable as long as N is assumed to be a finite number.
- Nevermark 4y agoAh! Very good point!! Thank you.