> On Jul 27, 11:58 am, John Cremona wrote:
> > My innocent posting to sage-devel on this subject two days ago seems
> > to have done something to increase the number of postings this month,
> > even if a lot of the discussion has been much wider than the orginal
> > title (Sage & Pari) suggests!
I cited Pari in a non-peer reviewed article today.
Bill.
On Jul 27, 11:58 am, John Cremona wrote:
> My innocent posting to sage-devel on this subject two days ago seems
> to have done something to increase the number of postings this month,
> even if a lot of the discussion has been much wider t
On 7/25/11 9:36 AM, Ivan Andrus wrote:
It doesn't attach pictures since aleph doesn't support pictures, so
the app doesn't (yet) support pictures. It will of course though
once I get it ported over to using simple-python-db-compute.
I just updated the singlecell server to our most current mas
If anyone is going to be at the MAA Mathfest, please respond here. It
would be great to get together.
As far as I know, we have the following Sage-related things going on:
1. information on a table somewhere (with WeBWorK and other MAA-related
things)
2. I'm doing a short (5-minute) present
On Wed, Jul 27, 2011 at 11:15 AM, Burcin Erocal wrote:
> Great idea! Such statistics would also help convince package authors
> that Sage provides exposure for their project as well as a separate
> (mathematical) test suite, regular build tests on many platforms and
> in many cases bug fixes.
>
>
On Wed, 27 Jul 2011 10:40:02 -0700
William Stein wrote:
> On Wed, Jul 27, 2011 at 10:08 AM, Andrey Novoseltsev
> wrote:
> > I have just looked over PARI citing discussion and recently I had a
> > talk with a developer of a software package X who was concerned that
> > inclusion of X into Sage wi
On Wed, Jul 27, 2011 at 10:48 AM, Jason Grout
wrote:
> On 7/27/11 10:08 AM, Andrey Novoseltsev wrote:
>>
>> To get these lists, it seems to me that one can execute the code
>> "f(75)" in a profiler, collect used functions, and then look for
>> substrings (either modules or particular functions) fr
Hi Andrey,
On Wed, 27 Jul 2011 10:08:18 -0700 (PDT)
Andrey Novoseltsev wrote:
> I have just looked over PARI citing discussion and recently I had a
> talk with a developer of a software package X who was concerned that
> inclusion of X into Sage will mean that people will stop giving credit
> to
On Tue, Jul 26, 2011 at 10:06 PM, William Stein wrote:
> Hi Sage Developers,
> To help with porting Sage to OS X 10.7, I bought 10.7, installed it, and
> setup a public-facing machine (actually, the old bsd.math.washington.edu)
> with OS X 10.7 and *XCode 4.1* installed on it. If you had an acc
On Wed, Jul 27, 2011 at 10:48 AM, Jason Grout
wrote:
> IIRC, someone (Mike Hansen, I believe) wrote something that would track
> pexpect interfaces or something to see what software was being used. I
> cannot find the command name for his function, though.
>
sage: from sage.misc.citation import
On 7/27/11 10:08 AM, Andrey Novoseltsev wrote:
To get these lists, it seems to me that one can execute the code
"f(75)" in a profiler, collect used functions, and then look for
substrings (either modules or particular functions) from a list that
gives matches of substrings to components. This lis
On Wed, Jul 27, 2011 at 10:08 AM, Andrey Novoseltsev wrote:
> I have just looked over PARI citing discussion and recently I had a
> talk with a developer of a software package X who was concerned that
> inclusion of X into Sage will mean that people will stop giving credit
> to X (and this develop
I have just looked over PARI citing discussion and recently I had a
talk with a developer of a software package X who was concerned that
inclusion of X into Sage will mean that people will stop giving credit
to X (and this developer in particular ;-)) Sometime ago there were
suggestions to somehow
My innocent posting to sage-devel on this subject two days ago seems
to have done something to increase the number of postings this month,
even if a lot of the discussion has been much wider than the orginal
title (Sage & Pari) suggests!
John
--
To post to this group, send an email to sage-devel
Of course if you code is so dependent on CPU cycles then it is a good
candidate for assembly optimisation. After superoprimisation you might
hit the theoretical retirement rate of muops in which case you can
actually say something about how fast it will run. Integer arithmetic
is one such case.
In
On Wednesday, July 27, 2011 10:33:57 AM UTC+1, Bill Hart wrote:
>
> It's rarely possible to fully
> explain a cutoff without reference to the architecture, e.g.
> Instruction latency, caching, etc
Thats an understatement. The current state of CPUs makes it factually
impossible to precisely qua
Hi Tim,
Let me first say that I am a little embarrassed that you downloaded
Flint as a possible example of literate code. Reading my original post
I did seem to give that impression. Actually I was merely mentioning
it as an example of a documented system, not necessarily literate as
such.
I did
17 matches
Mail list logo
