Galois Theory of Algorithms

Details Galois Theory of Algorithms Galois Theory of Algorithms

2010-10-29

arxiv.org/abs/1011.0014v1

Mathematics

Rings and Algebras

22 pages, 1 figure

Scientific paper

Many different programs are the implementation of the same algorithm. This makes the collection of algorithms a quotient of the collection of programs. Similarly, there are many different algorithms that implement the same computable function. This makes the collection of computable functions into a quotient of the collection of algorithms. Algorithms are intermediate between programs and functions: Programs -> Algorithms -> Functions. Galois theory investigates the way that a subobject sits inside an object. We investigate how a quotient object sits inside an object. By looking at the Galois group of programs, we study the the intermediate types of algorithms possible. Along the way, we formalize the intuition that one program can be substituted for another if they are the same algorithms.

Affiliated with

Also associated with

No associations

Rating

Galois Theory of Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Galois Theory of Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Galois Theory of Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-404816