Re: Not enough parallelism in programming




In article <1125499696.90335@xxxxxxxxxxxxxxxxxxx>, Sander Vesik <sander@xxxxxxxxxxxxxxxxxxx> writes:
|> Nick Maclaren <nmm1@xxxxxxxxxxxxx> wrote:
|> >
|> > A's determinant! It does not change d - that is the point. The
|> > invariant that is broken is that d is not A's determinant on entry.
|> >
|> > Now exactly how can hardware detect that, in general, without
|> > solving the halting problem?
|>
|> I don't think it *could* solve the problem even in the hypothetical case
|> where it could solve the halting problem. Because what is missing is any
|> description of intent about the value of d.

Er, yes, it could. Create a program which terminates if the result
of running the above program is correct and loops if not. A solution
to the halting problem can tell if the derived program will halt ....


Regards,
Nick Maclaren.
.



Relevant Pages

  • Re: Not enough parallelism in programming
    ... > invariant that is broken is that d is not A's determinant on entry. ... where it could solve the halting problem. ... Prev by Date: ...
    (comp.arch)
  • Re: Not enough parallelism in programming
    ... if R can change d's determinant. ... |>> solving the halting problem? ... |> I don't expect even a magical auto-parallelisation system to correct bugs. ... But it's NOT a bug in the serial code, ...
    (comp.arch)
  • Re: discriminating SO3 invariance from general O3 invariance
    ... >>> Oinvariant, for antisymmetric matrices when n is even. ... action of an element of Owith determinant -1 sends P to -P. ... of the basis elements then has the same action as the identity. ...
    (sci.math)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... In other words a program without any loops could not be ... > determined to halt. ... that can determine if certain restricted classes of programs halt ... then it's not a solution to the halting problem. ...
    (comp.lang.cpp)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... In other words a program without any loops could not be ... > determined to halt. ... that can determine if certain restricted classes of programs halt ... then it's not a solution to the halting problem. ...
    (sci.logic)