Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.python > #103755 > unrolled thread

Loop awareness

Back to article view | Back to comp.lang.python

Contents

  Loop awareness jonas.thornvall@gmail.com - 2016-02-29 12:07 -0800
    Re: Loop awareness Ian Kelly <ian.g.kelly@gmail.com> - 2016-02-29 13:31 -0700
      Re: Loop awareness jonas.thornvall@gmail.com - 2016-02-29 13:53 -0800

#103755 — Loop awareness

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

[toc] | [next] | [standalone]

#103758

On Mon, Feb 29, 2016 at 1:07 PM,  <jonas.thornvall@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.

[toc] | [prev] | [next] | [standalone]

#103761

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@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

[toc] | [prev] | [standalone]

Back to top | Article view | comp.lang.python

csiph-web