ian.g.kelly at gmail.com
Mon Feb 29 15:31:56 EST 2016
On Mon, Feb 29, 2016 at 1:07 PM, <jonas.thornvall at gmail.com> wrote:
> This program creates a uniform linktree of x nodes, and it knows when it get stuck in a loop generating random values.
> Because the networks random generated, only a subset of the permutations will generate a uniform network most get stuck in loops generating random values. But the program keep track the exhausted links and knows when no uniform network possible.
> Is this related to the halting problem?
No, the halting problem is that you can't algorithmically determine
whether an *arbitrary* program given *arbitrary* input will ever halt.
When you narrow down the scope of the problem considerably, as you've
done here, then it's no longer necessarily undecidable.
More information about the Python-list