Re: Release of RosAsm V.2.025a


Charles A. Crayne wrote:
> On 21 Sep 2005 08:36:01 -0700
> "randyhyde@xxxxxxxxxxxxx" <randyhyde@xxxxxxxxxxxxx> wrote:
>
> :(a
> :problem that has been reduced to the halting problem, which has been
> :proven to be undecidable).
>
> Only on machines with infinite memory.

Of course, with only a *finite* amount of memory, even *less*
computation is possible. Therefore, it's *less* likely that you'll
produce a perfect disassembler when you've got a finite amount of
memory to play with than if you had an infinite amount of memory to
play with. After all, if you can write the perfect disassembler with a
finite amount of memory, you can *certainly* write it with an infinite
amount of memory.

Chuck, file this one under the "what were you thinking?" file.
Cheers,
Randy Hyde

.

Relevant Pages

  • Re: qsort
    ... On a system with infinite available ... >> memory, it will never terminate. ... In the real world, infinite recursion ... Since qsort() in particular is likely ...
    (comp.lang.c)
  • Re: Steps beyond "Hello World" program
    ... This is what Turing meant. ... > how much memory is available on the network, ... no solvable problem requires an infinite amount of memory. ... I agree that if you had such a construction rule then ...
    (comp.programming)
  • Re: turing completeness
    ... claim that the tape *must* be infinite. ... >>The Turing Machine just needs to be able at will to drive to CompUsa ... computer runs out of memory its operating system aborts the TM ...
    (comp.programming)
  • Re: Memory is not infinite
    ... it appears the brain can't remember infinite things because it ... brains cannot have infinite memory capacity. ... since information would be lost continually. ...
    (talk.origins)
  • Re: Arthur ODwyer on the feasibility of simulating a Turing Machine
    ... >>memory that is only one binary digit. ... >>into unlimited storage. ... > infinite number of decimal digits, infinitely long, on the one square. ...
    (comp.programming)