Math::Goedel - Fundamental Goedel number calculator

1 ++

1 ++

Goedel number is calculated by following Goedel's encoding theorem enc(X0X1X2...Xn) = P0**X0 * P1**X1 * P2**X2 * ..... * Pn**Xn *Xk* is a *k* th digit (from left hand) of input number. *Pk* is a *k* th prime number....

TURUGINA/Math-Goedel-0.04 - 22 Sep 2013 03:17:11 UTC - Search in distribution

Math::GSL::PowInt - Integer Power functions

8 ++

8 ++

This module implements the GSL Integer Power functions, which allow one to quickly compute a given integer raised to any real number. It contains gsl_pow_2 to gsl_pow_9 and gsl_pow_int. If you need a power higher than 9, you can use gsl_pow_int, whic...

HAKONH/Math-GSL-0.44 - 01 Dec 2023 19:49:12 UTC - Search in distribution

• Math::GSL::PowInt - Integer Power functions