Group Abstract Group Abstract

Message Boards Message Boards

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

Are series expansions for functions considered computationally irreducible?

Murat Ayfer
Posted 5 years ago
POSTED BY: Murat Ayfer
5 Replies
Sort By:
POSTED BY: Hans Dolhaine
Murat Ayfer
Murat Ayfer
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

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
Murat Ayfer
Murat Ayfer
Posted 5 years ago
POSTED BY: Murat Ayfer

Murat, you are referring to the subject of Numerical Analysis as "Optimized Simulation". In my opinion this is an equivocation.
POSTED BY: Richard Frost
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Tag limit exceeded
Note: Only the first five people you tag will receive an email notification; the other tagged names will appear as links to their profiles.
Reply Preview
Attachments
Remove
or Discard