Re: Imaginary Polynomial Time Algorithm for Subset sum Problem

Tim Tyler wrote:
Jym wrote:

And that's also the problem with the OP stamping process: it can copy an arbitrarily large number of dots in a single unit of time. While on any realistic computer/model, copying an array (typically), would take time proportional to its size.

FWIW, copying an array does not take up time which is proportional to the size of the array on a parallel computer.

Are you assuming a bounded or unbounded number of processors?