Group Abstract Group Abstract

Message Boards Message Boards

0
|
4.2K Views
|
5 Replies
|
0 Total Likes
View groups...
Share
Share this post:

Are series expansions for functions considered computationally irreducible?

Posted 5 years ago

Functions like e^x, sqrt, sin etc. are calculated via their series expansions in calculators.

These are often optimized versions of the simple theorems that were first proven, but it really does seem like there is no ultimate shortcut to finding the answer to these functions other than using lookup tables.

What would Stephen Wolfram say about the computation reducibility of these functions?

Do, for example, exponential functions require step-by-step exponential growth simulations to get the answer no matter what?

POSTED BY: Murat Ayfer
5 Replies
POSTED BY: Richard Frost
Posted 5 years ago
POSTED BY: Murat Ayfer

There are numeric algorithms for approximating those functions, to whatever precision. They have known complexity. It is not clear how that ties into "computational irreducibility". What would you mean if you were to say "computing pi is/is not computationally irreducible"?

POSTED BY: Daniel Lichtblau
Posted 5 years ago

I assume you are familiar with Stephen Wolfram's concept of computation irreducibility?

I am just curious if within his definition, natural functions like exponentiation, square root, sin, cos and the like are considered computationally irreducible or not.

POSTED BY: Murat Ayfer

Heee? What do you want?

POSTED BY: Hans Dolhaine
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard