Algorithmic Mathematics

Introduces the basic algorithms for computing and provides a constructive approach to abstract mathematics.

**Tag(s):**
Mathematics

**Publication date**: 01 Jan 2004

**ISBN-10**:
n/a

**ISBN-13**:
n/a

**Paperback**:
n/a

**Views**: 16,228

**Publisher**:
n/a

**License**:
n/a

**Post time**: 09 Dec 2007 06:51:39

Algorithmic Mathematics

Introduces the basic algorithms for computing and provides a constructive approach to abstract mathematics.

Excerpts from the Preface:

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.

Exercises are provided. They have a degree of difficulty comparable to that of examination questions. Some of the exercises consist of short essays; in this context, the notation [ ] indicates that mathematical symbols are not permitted in the essay. Starred sections contain optional material, which is not examinable.

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.

Exercises are provided. They have a degree of difficulty comparable to that of examination questions. Some of the exercises consist of short essays; in this context, the notation [ ] indicates that mathematical symbols are not permitted in the essay. Starred sections contain optional material, which is not examinable.

Tweet 0

About The Author(s)

No information is available for this author.

No information is available for this author.

Book Categories

Computer Science
34
Introduction to Computer Science
35
Algorithms and Data Structures
17
Object Oriented Programming
19
Theory of Computation
18
Formal Methods
18
Functional Programming
10
Logic Programming
19
Artificial Intelligence
19
Computer Vision
6
Big Data
2
Neural Networks
18
Compiler Design and Construction
14
Computer Organization and Architecture
8
Parallel Computing
3
Concurrent Programming
19
Operating Systems
17
Data Communication and Networks
23
Information Security
6
Information Theory
23
Digital Libraries
14
Information Systems
57
Software Engineering
17
Game Development and Multimedia
7
Data Mining
17
Machine Learning

Mathematics
58
Mathematics
10
Algebra
5
Category Theory
18
Linear Algebra
9
Computer Aided Mathematics
8
Discrete Mathematics
6
Numerical Methods
5
Graph Theory
13
Operations Research
12
Statistics

Supporting Fields
Operating System
Programming/Scripting
6
Ada
12
Assembly
25
C / C++
8
Common Lisp
2
Forth
33
Java
8
JavaScript
1
Lua
13
Microsoft .NET
11
Perl
5
PHP
34
Python
1
Rebol
9
Ruby
1
Scheme
3
Tcl/Tk

Miscellaneous