TITLE

Mysteries of mathematics and computation

AUTHOR(S)
Shub, Michael
PUB. DATE
January 1994
SOURCE
Mathematical Intelligencer;Winter94, Vol. 16 Issue 1, p10
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Presents the author's lecture entitled `The Future of the Theory of Computing.' Relations of theory to practice; Examples; Data processing; Computer graphics as tools for study of low-dimensional dynamical systems; Theorems; Difficulty of tracing the intellectual origin of ideas in practice.
ACCESSION #
9406151846

 

Related Articles

  • On An Entropy Conservation Principle. Manuceau, Jerome; Troupe, Marylene // Journal of Applied Probability;Jun99, Vol. 36 Issue 2, p607 

    Focuses on a study which presented an entropy conservation principle applicable to either discrete or continuous variables which provides a useful tool for aggregating observations. Associated method; Entropy conservation principle; Proposition; Conclusions.

  • Discrete mathematics and curriculum reform. Kenney, Margaret J. // Journal of Education;1996, Vol. 178 Issue 2, p51 

    Discusses discreet mathematics as a required course for the study of computer science. Coverage of topics which influence the lives of those who must interface with a technological society; Applications in a range of problems in various disciplines; Inclusion in the curriculum to enrich...

  • Asymptotic Behavior of a Geman and McClure Discrete Model. Rosati, M. // Applied Mathematics & Optimization;2000, Vol. 41 Issue 1, p51 

    Abstract. In this paper we consider a class of discrete variational models derived from a theory of Geman and McClure (see [15]) and study their asymptotic behavior when their stepsize tends to zero. It is shown that a result of GAMMA-convergence toward a certain functional holds true if a...

  • FPGA cores accelerate DFT computations. Conner, Doug; Granville, Fran // EDN;8/15/96, Vol. 41 Issue 17, p32 

    Introduces the R100 family of cores from Rice Electronics for discrete Fourier transforms mathematical computations.

  • Distributed State Space Generation of Discrete-State Stochastic Models. Ciardo, Gianfranco; Gluckman, Joshua; Nicol, David // INFORMS Journal on Computing;Winter98, Vol. 10 Issue 1, p82 

    Examines the distributed state space generation of discrete-state stochastic models. Methods for on-the-fly partitioning; Implementation of a distributed state space generator that may be linked to a number of existing system modeling tools; Partitioning strategies in the context of Petri net...

  • Graph and Group Classifications of Terms in Adiabatic and Semiclassical Expansions. Fulling, S.A. // Annals of Combinatorics;2000, Vol. 4 Issue 3/4, p307 

    Describes ways in which concepts from discrete mathematics are being used to bring order into the welter of terms that appear when asymptotic expansions of propagators or heat kernels are carried out to high orders. Applications of asymptotic expansions of quantum propagators; Details on...

  • THE ARITIFICIAL BOUNDARY CONDITION FOR EXTERIOR OSEEN EQUATION IN 2-D SPACE. Zheng, Chun-xiong; Han, Hou-de // Journal of Computational Mathematics;Nov2002, Vol. 20 Issue 6, p591 

    Proposes a finite element method for the solution of Oseen equation in exterior domain. Relation between the normal stress and the prescribed velocity field; Details of the circular artificial boundary aimed to make the computational domain infinite; Drawbacks encountered with the actual...

  • Regular Splitting and Potential Reduction Method for Solving Quadratic Programming Problem with Box Constraints. Wei, Zi-Luan // Journal of Computational Mathematics;Nov2002, Vol. 20 Issue 6, p643 

    Presents a regular splitting and potential reduction method for solving a quadratic programming problem with box constraints. Discussion on the regular splitting and potential reduction algorithm; Complexity analysis of the algorithm; Analysis of the complexity bound on obtaining an approximate...

  • The Hadwiger Number of Jordan Regions Is Unbounded. Otfried Cheong; Mira Lee // Discrete & Computational Geometry;May2007, Vol. 37 Issue 4, p497 

    Abstract  We show that for every n > 0 there is a planar topological disk A0 and n translates A1, A2, ..., An of A0 such that the interiors of A0, ..., An are pairwise disjoint, but with each Ai touching A0 for 1 �?� i �?� n.

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sign out of this library

Other Topics