From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id C4E88BBB7 for ; Tue, 25 Jul 2006 23:08:14 +0200 (CEST) Received: from pauillac.inria.fr (pauillac.inria.fr [128.93.11.35]) by nez-perce.inria.fr (8.13.6/8.13.6) with ESMTP id k6PL8EKa021297 for ; Tue, 25 Jul 2006 23:08:14 +0200 Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id XAA22486 for ; Tue, 25 Jul 2006 23:08:13 +0200 (MET DST) Received: from einhorn.in-berlin.de (einhorn.in-berlin.de [192.109.42.8]) by nez-perce.inria.fr (8.13.6/8.13.6) with ESMTP id k6PL8Ajs021276 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=FAIL) for ; Tue, 25 Jul 2006 23:08:13 +0200 X-Envelope-From: oliver@first.in-berlin.de X-Envelope-To: Received: from first.in-berlin.de (e178055143.adsl.alicedsl.de [85.178.55.143]) (authenticated bits=0) by einhorn.in-berlin.de (8.13.6/8.13.6/Debian-1) with ESMTP id k6PL82Y8014488 for ; Tue, 25 Jul 2006 23:08:02 +0200 Received: by first.in-berlin.de (Postfix, from userid 501) id 940A92EE24D; Tue, 25 Jul 2006 23:08:17 +0200 (CEST) Date: Tue, 25 Jul 2006 23:08:17 +0200 From: Oliver Bandel To: caml-list@inria.fr Subject: super-recursive algorithms Message-ID: <20060725210817.GA2154@first.in-berlin.de> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline User-Agent: Mutt/1.5.6i X-Scanned-By: MIMEDefang_at_IN-Berlin_e.V. on 192.109.42.8 X-Miltered: at nez-perce with ID 44C6883E.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Miltered: at nez-perce with ID 44C6883A.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; bandel:01 in-berlin:01 hvf:98 wrote:01 oliver:01 oliver:01 lazy:01 lazy:01 programming:03 programming:03 algorithms:03 algorithms:03 texts:06 seem:07 explain:11 X-Spam-Checker-Version: SpamAssassin 3.0.3 (2005-04-27) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.1 required=5.0 tests=FORGED_RCVD_HELO autolearn=disabled version=3.0.3 Hello, someone who is able to explain me them? What are super-recursive algorithms? How are they related to lazy programming? The less I found about them seem to point in a direction, that HvF has mentioned in his texts, where he wrote about calculating a reality. Are they endless calculations, and therefore related to lazy programming? Thanks in Advance, Oliver