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