Axiom Space, a Houston-based company, is not related to Axiom the scientific
computation system. Or is it?
William
William Sit
Professor Emeritus
Department of Mathematics
The City College of The City University of New York
New York, NY 10031
homepage: wsit.ccny.cuny.edu
hey should be considered equal (unless there is a problem with
computing the LCM of denominators of the coefficients).
William
William Sit
Professor Emeritus
Department of Mathematics
The City College of The City University of New York
New York, NY 10031
homepage: wsit.ccn
uch a domain (in any computer
algebra system) exist these days? After all, nearly three decades have passed.
William
William Sit
Professor Emeritus
Department of Mathematics
The City College of The City University of New York
New York, NY 10031
homepage: wsit.ccny.cuny.edu
__
I am sure I am just being ignorant to pose these questions, because they must
have been considered and perhaps solved. In that case, please ignore them and
just tell me so.
William
William Sit
Professor Emeritus
Department of Mathematics
The City College of The City University of New Yor
ations. Of course,
these tools must also be proven with the same rigor since behind every program
is an algorithm.
William
William Sit
Professor Emeritus
Department of Mathematics
The City College of The City University of New York
New York, NY 10031
homepage: wsit.ccny.cu
ying system, there is
also just one overhead call (currying) for input (here, I assume the currying
system has optimized its implementation), and perhaps another (decurrying, if
the output is a function).
There is no need to reinvent the wheel for either system.
William
William Sit
Professor E
ils)". I am ignorant of type theory and often
confused by terms like type, equation (equation type?), identity, and even
proposition (like x = x + 0 is an identity) as used in proof theories. Please
ignore this message if the first paragraph is irrelevant to this thread.
William Sit
Professor E
Amen.
William
William Sit
Professor Emeritus
Department of Mathematics
The City College of The City University of New York
New York, NY 10031
homepage: wsit.ccny.cuny.edu
From: Axiom-developer
on behalf of Tim
Daly
Sent: Saturday, December 22, 2018 3
think weave is one to many in general, but unweave can be one to
one and thus possibly loses the generality of input latex string given to the
weave routine.
William
William Sit
Professor Emeritus
Department of Mathematics
The City College of The City University of New Yo
Hi Tim:
A question: how would you handle overloading of operators like *
("multiplication") in a semantic mark-up? Need the markup be as detailed as
the compiler requires or just sloppy enough that the interpreter can figure out
the correct semantic?
William
William Sit
nother way, the semantic chunk is a direct (by hand
or automatic) translation of the latex version of an algorithm chunk.
Also, what would be the scope of the added semantic macros in LaTeX (like \AD,
\INT)? Can their scope be limited only to semantic chunks?
William
William Sit
Professo
/listinfo/axiom-developer
William Sit, Professor Emeritus
Mathematics, City College of New York
Office: R6/291D Tel: 212-650-5179
Home Page: http://scisun.sci.ccny.cuny.edu/~wyscc/
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
https
William Sit, Professor Emeritus
Mathematics, City College of New York
Office: R6/291D Tel: 212-650-5179
Home Page: http://scisun.sci.ccny.cuny.edu/~wyscc/
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
https://lists.nongnu.org/mailman/listinfo
schrieb Victor Adamchik:
i originally thought that implementing (or
reimplementing) would be easy
as a walk in the park...
Victor
On 10/8/2014 3:31 PM, William Sit wrote:
Didn't Schneider implemented the algorithm in
Mathematica around 2000?
http://www.emis.de/journals/SLC/wpapers
William Sit, Professor Emeritus
Mathematics, City College of New York
Office: R6/291D Tel: 212-650-5179
Home Page: http://scisun.sci.ccny.cuny.edu/~wyscc/
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
https://lists.nongnu.org/mailman
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
https://lists.nongnu.org/mailman/listinfo/axiom-developer
William Sit, Professor Emeritus
Mathematics, City College of New York
Office: R6/291D Tel: 212-650-5179
Home Page: http://scisun.sci.ccny.cuny.edu/~wyscc
.
Kurt
Am 11.07.2012 19:48, schrieb William Sit:
In TeX, a^bc would be interpreted mathematically as
(a^b)c, whereas
a^{bc} would be interpreted as a^{b c}, where the
exponent is a product
of b and c, or an application of b on c. Neither
interpretation is what
is intended if bc is a single
-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
William Sit, Professor Emeritus
Mathematics, City College of New York
Office: R6/202C Tel: 212-650-5179
Home Page: http://scisun.sci.ccny.cuny.edu/~wyscc
)
(Fraction (Polynomial (Integer)))
c:=destruct(b)
c.2
which returns (Polynomial (Integer))
Does that help?
Tim
William Sit wrote:
Tim:
Interesting. Is there a similar function that is more
structural? say,
can I test whether some domain (which may be passed as a
parameter of
type Field
.
I came across this requirement in algorithms that may take
advantage of special knowledge of how the coefficient
field is constructed.
William
On Mon, 9 Nov 2009 21:21:28 -0600
Gabriel Dos Reis g...@integrable-solutions.net wrote:
On Mon, Nov 9, 2009 at 7:09 PM, William Sit
wy
SExpression
(10) - e:=(c.1=c1.1)
(10) false
Type: Boolean
William
On Tue, 10 Nov 2009 11:38:25 -0500
William Sit wy...@sci.ccny.cuny.edu wrote:
Thanks, Tim. That is exactly what I am looking for. Now I
would like to compare c.1
arguments for equal come from the same
domain SExpression. So is this a bug?
William
On Tue, 10 Nov 2009 12:00:58 -0500
William Sit wy...@sci.ccny.cuny.edu wrote:
Tim:
Sorry about the last message, please ignore.
The problem is solved (I was simply not being careful)
and made some false claims
detected within library code:
Non-list
protected-symbol-warn called with (NIL)
William
Waldek Hebisch wrote:
William Sit wrote:
Gabriel:
Thanks for the response. Your script shows how to get the
parameters, not the constructor. I do not have OpenAxiom
installed (sorry
the SExpressions out to other domains. Sometimes it is
painful but it works. So:
a:=FiniteField(5,2)
b:=devaluate(a)
string(SYMBOL_-NAME(b.1)$Lisp) == FiniteField (of type String)
integer(b.1) == 5 (of type PositiveInteger)
Does this help?
Tim
William Sit wrote:
It appears
Gabriel:
Thanks again for all the help. I'll download the OpenAxiom
version and try it.
William
On Tue, 10 Nov 2009 15:25:08 -0600
Gabriel Dos Reis g...@integrable-solutions.net wrote:
On Tue, Nov 10, 2009 at 1:37 PM, William Sit
wy...@sci.ccny.cuny.edu wrote:
Hi Waldek:
Thanks
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
William Sit, Professor Emeritus
Mathematics, City College of New York
Office: R6/202C Tel: 212-650-5179
Home Page: http://scisun.sci.ccny.cuny.edu/~wyscc
to be
applicable!
Does that make sense, that?
Thanks in advance for any clues! Are these bugs?
James
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
William Sit, Professor Emeritus
-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
William Sit, Professor Emeritus
Mathematics, City College of New York
Office: R6/202C Tel: 212-650-5179
Home Page: http://scisun.sci.ccny.cuny.edu/~wyscc
.
We make your business move.
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
William Sit, Professor Emeritus
Mathematics, City College of New
, he continued to attend
the Kolchin
Seminar at the Graduate Center, CUNY, and participated in
discussions.
We will miss him dearly.
Sadly,
William
--
William Sit, Professor Emeritus
Department of Mathematics..Email: wy...@sci.ccny.cuny.edu
City College of New YorkTel: 212-650
Dear Tim and Alfredo:
Okay, after some experimentation, I finally was able to
save changes to Doyen on the USB drive. Probably, it can
easily be saved on the hard disk as well.
The trick is to run from the USB drive (after it has
booted into Doyen) /boot/isolinux/liloinst.sh after the
.
William
William Sit, Professor Emeritus
Mathematics, City College of New York
Office: R6/202C Tel: 212-650-5179
Home Page: http://scisun.sci.ccny.cuny.edu/~wyscc/
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http
Tim:
I downloaded the zip file, unzip and copy boot and DOYEN
directories to the USB drive. Running bootinst.bat results
in MBR not written (Access denied). I login-ed on a
Windows machine running Vista Home Premium with SP1, as
administrator. Permission was denied due to physical
access to
Tim:
This email is not Axiom related, but Doyen OS related.
Maybe it is because I do not know how Doyen functions, but
I believe the Doyen USB version is not meant to replace an
alternative bootable version in the sense that the Doyen
drive is not writable (the USB drive is writable, but
On Wed, 28 May 2008 19:57:58 -0400
root [EMAIL PROTECTED] wrote:
So what will you tell them that you cannot figure out by
a proper
configure script automatically?
I do not know how to automatically and generically figure
out the
correct string, e.g. debian, macosxppc, fedora9
,etc. It
Psi
Phi [x,y,Z.2], t=0)::ULS(EXPR INT, t, 0))
output first Phi Psi Phi [x,y,Z2]
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
William Sit,
Professor of Mathematics, City
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
William Sit,
Professor of Mathematics, City College of New York
Office: R6/202C Tel: 212-650-5179, Fax: 212-862-0004
Home Page: http://scisun.sci.ccny.cuny.edu/~wyscc
Franz Lehner wrote:
Question: How exactly do I issue an ALLOCATE command?
For me a command like
)lisp (si::allocate-contiguous-pages 3 t)
seemed to work, although only at the beginning of a session.
You can get memory information with
)lisp (room)
I found this somewhere on the
I ran a computation (computing the radical of an ideal) that
aborted after 9 days with this message:
-- f0 is y0^2-x0^3, and f1, f2, f3 are the first, second and
third derivative of f0
-- when x1, x2, x3 (and y1, y2, y3) are interpreted as
first, second and third
-- derivatives of x0 (and y0)
@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
William Sit,
Professor of Mathematics, City College of New York
Office: R6/202C Tel: 212-650-5179, Fax: 212-862-0004
Home Page: http://scisun.sci.ccny.cuny.edu/~wyscc
.'
Martin
William Sit [EMAIL PROTECTED] writes:
Dear Martin:
May I suggest using a bit vector to notate the
fixes? I propose
that the bits of the bit vector be assigned
according to chronological
order of axiom branches, so that bit 0 is for Tim's
Axiom, bit 1 for
FriCAS and bit 2
On 12 Jan 2008 19:06:09 +0100
Martin Rubey [EMAIL PROTECTED] wrote:
What we need is a domain ASCII, that converts OutputForm
to ASCII art. I don't
think that this can be too difficult: you could start
with the mathml domain
and gradually replace mathml markup by ascii art.
Martin
I think
@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
William Sit,
Professor of Mathematics, City College of New York
Office: R6/202C Tel: 212-650-5179, Fax: 212-862-0004
Home Page: http://scisun.sci.ccny.cuny.edu/~wyscc
- \|- 1 log(- 3\|- 1 \|243 \|- v - v \|243 + 9\|- 1 )
/
6+---+
12\|243
Type: Union(Expression Integer,...)
(2) - )spool
--
William Sit
Department of Mathematics..Email: [EMAIL PROTECTED]
City College of New YorkTel
-expression, i.e.
(-4+v^3) to
(-4*v^3)
The integral presented in issue #361 still fails in newer versions of Axiom.
Regards,
Bill Page.
On 9/8/07, William Sit [EMAIL PROTECTED] wrote:
Thanks. In that case, the report file should be closed (assuming the
integral is
correct
Martin Rubey wrote:
I have used Aldor, SPAD, the Aldor interpreter and the axiom interpreter quite
intensively, and found the combination Aldor + axiom interpreter formidable.
What I found most impressive is that the axiom interpreter is designed well
enough to work seamlessly with new
Ralf Hemmecke wrote:
On 08/16/2007 12:11 PM, William Sit wrote:
... why aren't you and Ralf in favor of
improving the compiler so that the compiler can be equally helpful?
Because I believe we will end up in something like Maple or Mathematica.
I constantly hear people complain
Martin Rubey wrote:
My personal preference is:
* no automatic coercion in the compiler
In principle, I agree with this. The source of library code should be
unambiguous
(in addition to well-documented). In practice, it would be nice if there is
some
help, such as spitting out possible
Gabriel Dos Reis wrote:
On Sun, 12 Aug 2007, William Sit wrote:
| Isn't the problem whether 'Monad has SetCategory with *:(%,%)-%' ?
If the question is formulated in terms of has, then I think the answer
is unambiguously yes.
But, is that the way the compiler is intended or does
-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
--
William Sit
Department of Mathematics..Email: [EMAIL PROTECTED]
City College of New YorkTel: 212-650-5179
New York, NY 10031, USA.Fax: 212-862-0004
Home page
Ralf Hemmecke wrote:
Let's compile and run the program below.
woodpecker:~/scratchaldor -laldor -grun aaa.as
has with {foo: ()-()} = T
has with {bar: ()-()} = T
has with {rhx: ()-()} = T
has with {foo: ()-()} = T
has with {bar: ()-()} = T
has with {rhx: ()-()} = T
MDom has rhx? T
Bill Page and I have a discussion on has and with on
http://wiki.axiom-developer.org/SandBoxCategories
but the changes/emails seem not to have been sent out yet.
William
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
Bill:
Ah, of course (SandBox), stupid me!
Thanks for upgrading the page.
Now I wonder if I should remove my wrong conjecture on
has has higher precedence. What do you think (as a
general principle, should wrong explanations be removed)?
William
On Sun, 12 Aug 2007 18:00:40 -0400
Bill Page
The question is not so much whether the rules are followed as to *when* a
type (domain and category, perhaps even package) becomes named. Note that
the examples given in Davenport are for domains, not categories. Are there
differences in handling between named domains and named categories? unnamed
On Sun, 12 Aug 2007 20:19:47 -0500 (CDT)
Gabriel Dos Reis [EMAIL PROTECTED] wrote:
On Sun, 12 Aug 2007, Bill Page wrote:
| On 8/12/07, Gabriel Dos Reis wrote:
| On Sun, 12 Aug 2007, Bill Page wrote:
| | ...
| | It should be fine because of rule 2:
| |
| | 2. Anonymous types are equivalent
Epilog: I must be writing this after smoking ... . I have
put this away in my draft folder for a few days because I
know little about databases. Encouraged by Stephen's
prompt, I decide finally to submit it for whatever it is not
worth. I suppose I could have rephrased things in question
form,
.
--
Waldek Hebisch
[EMAIL PROTECTED]
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
--
William Sit
Department of Mathematics..Email: [EMAIL PROTECTED]
City College of New
Stephen Wilson wrote:
William Sit [EMAIL PROTECTED] writes:
In summary, we need:
(1) make a list or set of domains from SetCategory (or any category) a
legal construction
(2) SetAsDomain to convert a list or set of domains (or elements, or maps,
perhaps or
categories
William Sit wrote:
In the proposed IndexedUnion, what is missing is the Rep:= Record[index:I,
value:
g(i)].
Actually, this can probably be similated by Record(i:I, x:Any) to avoid
dependent
types.
However, there is another problem: the signature of the index map
g: I-List
- INT
implemented: slot $(Integer) from INT
[5] signature: INT - INT
implemented: slot $$ from INT
[6] signature: INT - INT
implemented: slot $$ from INT
(6) 1
Type: Integer
William
---
William Sit
Dear Bill:
Before we get into more category theory, the prerequisite
for even talking about colimits (or limits) is the very
simple idea of a family of morphisms (as well as objects) as
required in these constructions (for example, the notion of
a diagram). This is no more than an indexed set and
Stephen Wilson wrote:
Main question is _why_ they [hybrid union] might be desirable.
Spad does not support them. Aldor might in theory, but only in
theory.
[...]
Do you have an argument for `hybrid' Unions?
Gabriel Dos Reis wrote:
In general, I'm of the opinion that the language should
understanding the
simplest
domain constructions, how can we ever document the cutting edge algebra
domains?)
I read your post over a few times ...
Sorry, I'll try to write clearer next time around. (Clearly, it is difficult to
write ...).
William Sit [EMAIL PROTECTED] writes:
[...]
The above
Stephen Wilson wrote:
I agree that the challenge is great. Perhaps if we can get an
IndexedUnion implemented we can work together to get some good
documentation together? You are far more capable of writing for the
mathematically inclined reader, and I would hope to be able to
contribute
C Y wrote (Re: Paper usage policy (for authors)):
Whether pamphlets qualify is probably a question for a lawyer.
I'm assuming anyone other than the original author has no special
rights period.
Question for a lawyer means question for the courts? If the
authors have the residual rights as
://lists.nongnu.org/mailman/listinfo/axiom-developer
William Sit,
Professor of Mathematics, City College of New York
Office: R6/202C Tel: 212-650-5179, Fax: 212-862-0004
Home Page: http://scisun.sci.ccny.cuny.edu/~wyscc/
___
Axiom
[EMAIL PROTECTED] wrote:
There is a constant drumbeat to expand the number of developers.
To quote Chris DiDona, Danese Cooper, and Mark Stone (Open Sources 2.0
ISBN 0-596-00802-3, pXXVIII):
Brooks' Law appears to set a fundamental limit on the optimal
size of programming teams --
Dear Waldek:
I feel sad that you have decided to listen to Tim, but
precisely at the wrong time! I understand that your decision
has been provoked by Tim's message (A modest proposal). I
was surprised that Tim chose to communicate his convictions
in such a strong and provocative manner. I take
Ralf Hemmecke wrote:
[sniped]
I don't quite know whether Tim wants to have both kinds of documentation
in the Axiom project. If I understood correctly, that is the facets of
the crystal view. Yes, Axiom should be a big monster which not only
contains code.
It should be a collection of
1
[EMAIL PROTECTED] wrote:
William,
I apologize that I've been sarcastic to you in public. As you know
from personal experience I hold you and your opinions in high esteem.
Please accept my apology.
Tim
A bit of sarcasm was exactly what's needed to bring the
issues out! But be careful
[EMAIL PROTECTED] wrote:
[sniped]
That said, you have recently agreed to allow me to use the paper I
converted as the basis for a pamphlet form of your work. Since you
disagree so strongly about making pamphlets perhaps we can compromise.
I'll make an effort to understand your algebra and an
The following email (with minor changes) was originally sent
to Tim and he replied: Post your suggestion publicly. Ask
for a vote. We will go with the majority opinion. You get to
keep the final count.
So please feel free to comment, and may be Bill Page can set
up a sandbox page to keep votes?
Martin:
Regarding your test for multivariate polynomial
multiplication:
On my machine (Windows), I got:
[[10,1], [10,0], [10,1], [10,0], [10,1],
[20,2], [20,2], [20,1], [20,1],[20,2],
[30,4], [30,4], [30,3], [30,4], [30,4],
[40,8], [40,7], [40,7],[40,8], [40,7],
[50,12],
the data-structure comes into play. Not sure if
converting your computation to DMP and back would save time.
William
--
William Sit
Department of Mathematics..Email: [EMAIL PROTECTED]
City College of New YorkTel: 212-650-5179
New York, NY 10031, USA.Fax: 212-862
Martin Rubey wrote:
Bill Page [EMAIL PROTECTED] writes:
and, most importantly, sockets on windows!
??? There is support for sockets on Windows in GCL and this works
for axiom-0.1.4 on Windows.
In fact, that's good news.
But, why couldn't anybody run my code on windows so far?
According the Microsoft, after World Wide Web Publishing
started, web pages should be placed in C:\Inetpub\wwwroot.
Is there a patch I can do for hyper.lisp that would change
where files served are located?
Your Web service is now running.
You do not currently have a default Web page established
) network like a home network.
Or is the Axiomsys to Browser connection independent of
World Wide Web Publishing?
William
On Fri, 15 Jun 2007 12:11:25 -0400
William Sit [EMAIL PROTECTED] wrote:
According the Microsoft, after World Wide Web Publishing
started, web pages should be placed in
C
On 11 Jun 2007 09:57:43 +0200
Martin Rubey wrote:
William, I just saw
(1) - SOCKET(8080, getDocumentation$HyperDoc)
don't you need to package call SOCKET$Lisp ?
Thanks Martin. I was just following your directions :-).
[...]
Try
ops: Database IndexCard := getDatabase(o $OperationsQuery
On Mon, 11 Jun 2007 06:45:49 -0400
Alfredo Portes [EMAIL PROTECTED] wrote:
To remove the grep error do as explained by Waldek:
)lisp (setf |$standard| 't)
)lisp (setf |$saturn| 'nil)
Yes, that does get around the GREP problem, but a new one
pops up:
(1) - )sys grep hyper hyper~1.spa
On Mon, 11 Jun 2007 07:36:39 -0400
William Sit [EMAIL PROTECTED] wrote:
(1) - SOCKET(8080, getDocumentation$HyperDoc)
grep.exe: libdb.text: No such file or directory
[...]
I believe this is due to the 8.3 convention. I see
libdb.text in the path: .../windows/lib/.
I see that you are also
On 11 Jun 2007 14:50:04 +0200
Martin Rubey [EMAIL PROTECTED] wrote:
William Sit [EMAIL PROTECTED] writes:
(1) - )library hyper
HyperDoc is now explicitly exposed in frame initial
HyperDoc will be automatically loaded when needed
from
/OpenAxiom/axiom014/mnt/windows/lib
Martin Rubey wrote:
Dear William,
first of all, thank you for your patience!
Thank you, and Bill, and Alfredo for helping.
roughly: (I put
)lib HYPER
)lisp (load hyper.lisp)
SOCKET(8080, getDocumentation$HyperDoc)$Lisp
into a file hyper.input)
I still can't read an input
On Mon, 11 Jun 2007 18:23:11 +0200 (CEST)
Franz Lehner [EMAIL PROTECTED] wrote:
What? Is this axiom in 2007? How can you use axiom
without reading
input files?
well, some of my students reported that copy and paste
does not work and came up with handwritten notes for the
exercise sessions
wonder why you did not move it to a separate IssueTracker?
It is bug in the implementation of 'expand' (incompatibility
with 'BY').
On June 7, 2007 9:21 PM William Sit wrote:
...
I am overwhelmed by the amount of Axiom emails and most
I could not follow. I don't even have the guts to try
Dear Martin:
I tried hyperdoc package on Windows
/mathaction/SandBoxHyperDocReplacement.
It compiled and loaded, but SOCKET does not work:
OPTIMIZE levels: Safety=0 (No runtime error checking),
Space=0, Speed=3, (Debug
quality ignored)
Finished compiling
is exhausted.
Currently, 82872 pages are allocated.
Use ALLOCATE to expand the space.
protected-symbol-warn called with (NIL)
---
Waldek Hebisch wrote:
William Sit wrote:
System error:
The storage for CONS is exhausted.
Currently, 82689 pages are allocated.
Use ALLOCATE
tell me how to increase the space? Exactly how
big is one page? I have 2GB RAM. Is it possible to allocate
the max to Axiom (under Windows XP)?
Thanks.
William
--
William Sit
Department of Mathematics..Email: [EMAIL PROTECTED]
City College of New YorkTel: 212-650-5179
New York, NY
On Sat, 03 Feb 2007 15:41:57 -0500
William Sit [EMAIL PROTECTED] wrote:
System error:
The storage for CONS is exhausted.
Currently, 82689 pages are allocated.
Use ALLOCATE to expand the space.
Can any one tell me how to increase the space? Exactly
how
big is one page? I have 2GB RAM
The following may be contraversial but their experience may
be relevant to Axiom Foundation. Perhaps we can avoid what
Jaspert predicted, and please do not start any discussions
:-).
(This is old news, so may be it has been posted already,
or the situation has changed.)
Disgruntled Debian
Bill Page wrote:
So it seems that we can only wish that we had the problems the
Debian has. :-)
Maybe that is a blessing in disguise. I think the donations have been
dribbling in because people do not see how the awards can be helpful.
When the award is too small, it is not a meaningful
Martin Rubey wrote:
it seems that I am quite difficult to understand. ... The
package is attached below.
I would agree :-). Since you already have the package, I don't know why you are
asking these
questions! Actually, after a preliminary reading your package, I have more
questions than
Martin Rubey wrote:
First things first. I had yet another idea, which avoids the problems of EXPR
a
little. To put things into the right setting, I quote our discussion:
I definitely don't want to restrict to EXPR INT. It should work with any
domain that has TRANFUN.
No you don't
Martin:
If I understand your question correctly, at least in the
interpreter, there is no need to go to SUP F, especially
for domains like F = EXPR INT. In the example you give,
Now let F be EXPR INT, or, in fact, any domain that has
TRANFUN. Already series
as simple as g +- sin g - sin 1,
Martin Rubey wrote:
If I understand your question correctly, at least in the interpreter, there
is
no need to go to SUP F, especially for domains like F = EXPR INT. In the
example you give,
So, you would check whether F allows a transcendental element (i.e., another
variable)? That
On Mon, 18 Dec 2006 03:20:56 -0500
root [EMAIL PROTECTED] wrote:
Bill,
I tried this on the May 18, 2005 and December 14, 2006
versions.
The December version is the current gold, arch version
50.
I can't seem to reproduce the error.
Curious about the factor factorial 12399
If I do
On Mon, 18 Dec 2006 05:00:12 -0500
root [EMAIL PROTECTED] wrote:
NAG MAY18/05DEC14/06
f:=119646463 f:=119646463
f:=119646463
factor f = 119646463factor f = 119646463 factor f
= 119646463
prime? f = falseprime? f = false
On Tue, 17 Oct 2006 17:18:37 -0700 (PDT)
C Y [EMAIL PROTECTED] wrote:
integrate(%e^cos(x)*cos(x-sin(x)),x = 0..2*%pi)
Apparently this can be solved by Mathematica in it's
upcoming version.
We currently get failed.
Cheers,
CY
Apparently, Mathematica got this wrong in Version 5.2:
In[1]:=
Bill Page wrote:
On August 31, 2006 6:11 PM William Sit wrote:
Is there any info that is still useful on
http://page.axiom-developer.org?
No, I don't think so. This was my original personal home page
on the axiom-developer site. In addition to the wiki and the
portal, anyone who has
On Fri, 1 Sep 2006 11:01:07 -0400
Bill Page [EMAIL PROTECTED] wrote:
Is this better?
http://page.axiom-developer.org
Honestly? No. I did not check very carefully, but it seems
all you did was adding a front page as your personal web
page (which is good). But anyone reaching, say the page
Dear Bill:
Is there any info that is still useful on
http://page.axiom-developer.org?
Can some of these pages be deleted (or made unreadable by the public)?
It becomes very confusing to new users with so many info pages from the
past. Below are some sample wanderings:
I went and logged into
1 - 100 of 190 matches
Mail list logo
