Loop awareness

[jonas.thornvall at gmail.com]

Den måndag 29 februari 2016 kl. 21:32:51 UTC+1 skrev Ian:
> 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?
> >
> > 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.

Here i told it to only report the unfiorm subset of working networks.



http://jt.node365.se/mydebug2.html