*To*: cl-isabelle-users at lists.cam.ac.uk*Subject*: Re: [isabelle] 64-bit Java is 6x faster than 32-bit for a recursive fibonacci*From*: Gottfried Barrow <igbi at gmx.com>*Date*: Thu, 15 May 2014 11:54:06 -0500*In-reply-to*: <5374E9FA.1010201@gmx.com>*References*: <5374E9FA.1010201@gmx.com>*User-agent*: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:11.0) Gecko/20120312 Thunderbird/11.0

On 14-05-15 11:23, Gottfried Barrow wrote:

fun fib (n:int) = (if (n < 2) then n else (fib(n - 1) + fib(n - 2)));

Regards,

**Follow-Ups**:

**References**:**[isabelle] 64-bit Java is 6x faster than 32-bit for a recursive fibonacci***From:*Gottfried Barrow

- Previous by Date: [isabelle] 64-bit Java is 6x faster than 32-bit for a recursive fibonacci
- Next by Date: Re: [isabelle] 64-bit Java is 6x faster than 32-bit for a recursive fibonacci
- Previous by Thread: [isabelle] 64-bit Java is 6x faster than 32-bit for a recursive fibonacci
- Next by Thread: Re: [isabelle] 64-bit Java is 6x faster than 32-bit for a recursive fibonacci
- Cl-isabelle-users May 2014 archives indexes sorted by: [ thread ] [ subject ] [ author ] [ date ]
- Cl-isabelle-users list archive Table of Contents
- More information about the Cl-isabelle-users mailing list