On Mon, Feb 29, 2016 at 1:07 PM, <jonas.thornv...@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? > > http://jt.node365.se/mydebug1.html
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. -- https://mail.python.org/mailman/listinfo/python-list
