On Wed, Oct 18, 2023 at 07:00:58PM +0800, Qian Yun wrote:
>
>
> On 10/18/23 18:41, Waldek Hebisch wrote:
> > On Wed, Oct 18, 2023 at 06:14:03PM +0800, Qian Yun wrote:
> > > When running test suite with CMUCL, there's one error from finite.input:
> > >
> > > testTrue "testLookupIndex(CharacterClass)"
> > >
> > > Because it calls "size()$CharacterClass", which is "2^size()$Character",
> > > "2^1114112".
> > >
> > > First, for CMUCL it gives error because the exponent exceeds
> > > extensions:*intexp-maximum-exponent* (which is 10000).
> >
> > Yes, this is way too small for our needs.
>
> Which value do you suggest to use instead?
Largest that works, say 2^29 or similar. FriCAS may easily
produce numbers having millions of digits, longer calculations
of this sort take way too much time, but same are doable and
final result may be reasonably small. To compute GCD of
univariate polynomials FriCAS encodes them in numbers and
computes GCD of corresponding numbers (this is called heugcd).
So any limit on size of numbers is also limit on size of
univariate polynomials.
Using GMP number of machine words in a single number is
(or at least used to be) bounded by what fits into 32-bit
integer.
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to fricas-devel+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/fricas-devel/ZTBs5zT2vzr3TSVe%40fricas.org.
