Computers for Mathematics: Theoretical Solution versus Constructive Solution
M.r. Khadivi, Jackson State University, United States
JCMST Volume 21, Number 3, ISSN 0731-9258 Publisher: Association for the Advancement of Computing in Education (AACE), Waynesville, NC USA
In this article the role of technology and its pivotal—in many cases, indispensable—role in solving real-world problems is underscored. It is demonstrated that the existence of a solution to a problem, which has been proven by any means, does not guarantee a constructive solution of the problem.
In general, the problems are divided into two categories, namely, type I and type II. For any given type I problem, there is an algorithm for constructing the solution. Type I problems are divided into two classes I1 and I2. I1 includes those problems, for which the existing algorithm is a polynomial one, and I2 includes NP-complete problems, for which no polynomial time algorithms are known. For Type II problems, there are not any known algorithms to construct the solution, that is, one may be able to find the solution(s) by trial and error (heuristic). In this article the crucial and positive effects of technology in constructing the solution to Type II problems are surveyed. Also NP-complete problems and their role for constructing Public-Key Cryptosystems, and different existing Digital Schemes along with the role of technology and the advances in the field are discussed. Finally Mathematica (version 4) is being used to approximate or to construct the solutions to some of the Type II and Type I problems.
Khadivi, M.r. (2002). Computers for Mathematics: Theoretical Solution versus Constructive Solution. Journal of Computers in Mathematics and Science Teaching, 21(3), 281-286. Norfolk, VA: Association for the Advancement of Computing in Education (AACE).
© 2002 Association for the Advancement of Computing in Education (AACE)