Generating subroutine codes with MACSYMA

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Goppa Codes

Once quantum computers become operational all current public key crypto systems, PKCSs become obsolete. Fortunately, there are alternative quantum computer robust methods based on coding, on hashing, on multivariate polynomials, on lattices etc. One such candidate is the McEliece PKCS which is based on error correcting codes, e.g. Goppa codes. Hence, in order to implement the McEliece PKCS one ...

متن کامل

Teaching with Macsyma 2.2 for Windows

‘New Macsyma 2.2 Math Software understands plain English’. ‘We believe Macsyma 2.2 can halve the time and energy required to solve problems with math software’ (Richard Petti, President, Macsyma Inc.) This article looks at some of these advertising claims and considers the potential for such features as an aid in the teaching of mathematics to mathematicians, engineers and scientists. In a shor...

متن کامل

An Automated Consultant for MACSYMA

Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, Massachusetts 02139 Consider a person trying to solve a problem with a computer system he does not fully understand. And assume that, although he has encountered a difficulty due to his lack of knowledge, he is unwilling to learn more about the system than is necessary to solve the problem. The simplest way for him...

متن کامل

A Review of Macsyma

We review the successes and failures of the Macsyma algebraic manipulation system from the point of view of one of the original contributors. We provide a retrospective examination of some of the controversial ideas that worked, and some that did not. We consider input/output, language semantics, data types, pattern matching, knowledge-adjunction, mathematical semantics, the user community, and...

متن کامل

Generating error control codes with automata and transducers

We introduce the concept of an f -maximal error-detecting block code, for some parameter f between 0 and 1, in order to formalize the situation where a block code is close to maximal with respect to being error-detecting. Our motivation for this is that constructing a maximal error-detecting code is a computationally hard problem. We present a randomized algorithm that takes as input two positi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical and Computer Modelling

سال: 1988

ISSN: 0895-7177

DOI: 10.1016/0895-7177(88)90667-x