**Algorithmic Mathematics**

by Leonard Soicher, Franco Vivaldi

**Publisher**: Queen Mary University of London 2004**Number of pages**: 94

**Description**:

This text contains sufficient material for a one-semester course in mathematical algorithms, for second year mathematics students. The course requires some exposure to the basic concepts of discrete mathematics, but no computing experience. The aim of this course is twofold. Firstly, to introduce the basic algorithms for computing exactly with integers, polynomials and vector spaces. In doing so, the student is expected to learn how to think algorithmically and how to design and analyze algorithms. Secondly, to provide a constructive approach to abstract mathematics, algebra in particular. When introducing the elements of ring and field theory, algorithms offer concrete tools, constructive proofs, and a crisp environment where the benefits of rigour and abstraction become tangible. We shall write algorithms in a straightforward language, which incorporates freely standard mathematical notation. The specialized constructs are limited to the if-structure and the while-loop, which are universal.

Download or read it online for free here:

**Download link**

(0.5MB, PDF)

## Similar books

**An Architecture for Combinator Graph Reduction**

by

**Philip J. Koopman, Jr.**-

**Academic Press**

The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that compare favorably with previously reported techniques.

(

**17564**views)

**Algorithmic Algebra**

by

**Bhubaneswar Mishra**-

**Courant Institute of Mathematical Sciences**

The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra.

(

**23042**views)

**Mathematics for Algorithm and Systems Analysis**

by

**Edward A. Bender, S. Gill Williamson**-

**Dover Publications**

This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.

(

**31665**views)

**Mathematics in the Age of the Turing Machine**

by

**Thomas Hales**-

**arXiv**

Computers have rapidly become so pervasive in mathematics that future generations may look back to this day as a golden dawn. The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.

(

**16523**views)