009/3/4 Zan Lynx <[email protected]>: > Also many halting problems can be "solved" by finding a weak point and > changing the problem. That may sound like cheating, but it is still very > useful. > > For example, software code verifiers trying to prove if a piece of code > "halts" or not cannot do it for arbitrary input. But it can suggest to the > programmer, "Hey, put a contract/assert here to limit the range of inputs > and then I can prove it." > > for(i=0; i<x; i++) { print i } for unknown x may never halt, but: > > assert(x >= 0 && x < 1000) > for(i=0; i<x; i++) { print i } will provably halt at 1000 or sooner. > > There are similar fixes for other classes of problems where the fixes are > not necessarily pretty or elegant but result in answers that work well > enough in the real world.
Hey guys, could you please throw in some GURPS? I guess it's getting off-topic. Saluti, Marcelo Cortimiglia > -- > Zan Lynx > [email protected] > > "Knowledge is Power. Power Corrupts. Study Hard. Be Evil." > _______________________________________________ > GurpsNet-L mailing list <[email protected]> > http://mail.sjgames.com/mailman/listinfo/gurpsnet-l _______________________________________________ GurpsNet-L mailing list <[email protected]> http://mail.sjgames.com/mailman/listinfo/gurpsnet-l
