Article View: comp.lang.pascal.misc
Article #40Re: Tough FACTORIAL math problem...
From: Mike McCarty
Date: Fri, 16 Feb 1996 00:18
Date: Fri, 16 Feb 1996 00:18
25 lines
1460 bytes
1460 bytes
In article <4fv9r3$gpn@abel.cc.sunysb.edu>,
Chris Kushmerick <ckushmerick@ccmail.sunysb.edu> wrote:
)
)There are ways of doing infinite precision math operations. Macsyma used to do it
)and I believe Mathematica does too. As far as I know, they have traditionally been
)implmented in Lisp.
)
)
)--
)Chris Kushmerick
)<ckushmerick@ccmail.sunysb.edu>
There are no known ways of doing infinite precision math operations,
except for a very restricted subset of numbers. Every machine which man
has ever built, or thought of building, has only a finite number of
states. It may be that all physically realizable machines have only a
finite number of states, due to the laws of physics. In any case, no
machine built to date has the capability of even representing all
integers, let alone operating on them.
Mike
----
char *p="char *p=%c%s%c;main(){printf(p,34,p,34);}";main(){printf(p,34,p,34);}
I don't speak for DSC. <- They make me say that.
Technical Details
Message-ID:
<4g0ih7$pov@sun001.spd.dsccc.com>Path:
arc1-ca.pugleaf.net!sun001.spd.dsccc.com!spd!jmccartyReferences:
<4fr8be$ass@news.iconn.net> <4fv9r3$gpn@abel.cc.sunysb.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sun001.spd.dsccc.com!spd!jmccarty From: jmccarty@spd.dsccc.com (Mike McCarty) Newsgroups: comp.lang.pascal.misc,comp.lang.c++,comp.lang.c,comp.lang.pascal.borland Subject: Re: Tough FACTORIAL math problem... Date: 16 Feb 1996 00:18:47 GMT Organization: DSC Communications Corporation, Plano, Texas USA Message-ID: <4g0ih7$pov@sun001.spd.dsccc.com> References: <4fr8be$ass@news.iconn.net> <4fv9r3$gpn@abel.cc.sunysb.edu> NNTP-Posting-Host: aplo139.spd.dsccc.com