Chaitin's (try)

Bill Halchin
Thu, 30 Aug 2001 23:56:55

<html><div style='background-color:'><DIV>
<P>I already read the response concerning Peyton-Jones "Awkward Squad".&nbsp;Just a comment on</P>
<P>Chaitin's try.&nbsp;The "try"&nbsp;Lisp operator  is basically a bounded Turing machine, i guess??</P>
<P>Regards, Bill Halchin</P>
<DIV></DIV>&gt;From: Carl McTague <MCTAGUE@ONE.NET>
<DIV></DIV>&gt;Subject: Chaitin's (try) 
<DIV></DIV>&gt;Date: Thu, 30 Aug 2001 17:24:01 -0600 
<DIV></DIV>&gt;Does anybody have an interest in something like Gregory Chaitin's 
<DIV></DIV>&gt;function (try) from his custom lisp in Haskell? (Please see 
<DIV></DIV>&gt; for more information.) It 
<DIV></DIV>&gt;would be a function that attempts to evaluate its argument within a 
<DIV></DIV>&gt;specified amount of cpu time, returning something like Maybe's Nothing 
<DIV></DIV>&gt;(but perhaps more informative) in the case that time runs out, and 
<DIV></DIV>&gt;something like Just, otherwise. Would that toy with referential 
<DIV></DIV>&gt;Haskell mailing list 
<DIV></DIV></div><br clear=all><hr>Get your FREE download of MSN Explorer at <a href=''></a><br></html>