Re: interesting question

On Fri, 2 Nov 2007 12:51:47 -0800, Marcel Hendrix wrote
(in article <76043321123560@xxxxxxxxxxxxxx>):

Is there a faster solution without requiring infinite memory for any
arbitrary value of n?

Oh, these intertwined questions...

First of, any practical `arbitrary' value in this case has less than 32 bits.

If the practical value fits in 32-bits, the amount of memory needed is not
infinite, and would run on existing PCs with 8 GBytes of RAM.

Didn't Dykstra or Hoare prove that any recursion can be performed more
efficiently with a loop?

-- Charlie Springer

.

Relevant Pages

  • Re: StackOverflowException with attribute
    ... I figured that the recursion wasn't infinite. ... it would seem that the call to GetProperties on the ... You need to find some way to break this loop. ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: Halting Problem
    ... large due to recursion. ... there is a condition for the recursion to terminate. ... they don't have infinite memory. ... All programs without any loop, ...
    (comp.programming)
  • Re: interesting question
    ... Charlie Springer wrote: ... can prove that any recursion can be converted into a loop, ... an efficiency improvement is quite impossible. ...
    (comp.lang.forth)
  • Re: Raatikainens critique of Chaitin
    ... dealing with exponential Diophantine equations was ... A subset S of N is bi-immune for a class C if S is infinite but does ... You couldn't have a bi-immunity result for the problem of whether ... Bi-immunity was a concept from the early years of recursion theory, ...
    (sci.math)
  • Infinite loop in PSOS_INIT()
    ... ARM instruction set simulator) the processor goes into an infinite ... loop at PSOS_INIT. ... We are using ARMulator to simulate a system that has an ARM946ES ...
    (comp.arch.embedded)