*To*: Gottfried Barrow <igbi at gmx.com>*Subject*: Re: [isabelle] 64-bit Java is 6x faster than 32-bit for a recursive fibonacci*From*: Makarius <makarius at sketis.net>*Date*: Fri, 16 May 2014 18:42:31 +0200 (CEST)*Cc*: cl-isabelle-users at lists.cam.ac.uk*In-reply-to*: <5376399E.5060306@gmx.com>*References*: <5374E9FA.1010201@gmx.com> <5374F12E.2030901@gmx.com> <alpine.LNX.2.00.1405161628320.3424@lxbroy10.informatik.tu-muenchen.de> <5376399E.5060306@gmx.com>*User-agent*: Alpine 2.00 (LNX 1167 2008-08-23)

On Fri, 16 May 2014, Gottfried Barrow wrote:

The big question is always whether a language is using machine integersor big integers. If I know that a language is using machine integers,and it runs at fib(42) at 6 seconds, that's alright, but not thatimpressive, since ML uses arbitrary size ints, though it could beoptimizing, by using machine ints until it needs big ints.

To keep this on-track for isabelle-users, I propose that you make a small formalization in Isabelle/HOL to relate the two implementations.I thought it was somewhat on track. I've shown an example that 32-bitJava can be up to 6x slower than 64-bit Java, so 64-bit Java would be agood reason to try and get 64-bit Cygwin going, not that I expect that.Many times I've assumed that there's not a real benefit to 32-bitprograms, but I've shown there is.

From the subject of your initial mail, I was actually expecting some

Makarius

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

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

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

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

- Previous by Date: Re: [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: Re: [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