Church-Turing Thesis
The Turing Machine concept defines what is meant mathematically by an algorithmic procedure. Stated another way, afunction 
is effectively Computable Iff it can be computed by a Turing Machine.
References
Penrose, R. The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics. Oxford, England: Oxford University Press, pp. 47-49, 1989.
- Graph Two-Coloring
- Grassmann Algebra
- Grassmann Coordinates
- Grassmann Manifold
- Gray Code
- Great Circle
- Great Cubicuboctahedron
- Great Deltoidal Hexecontahedron
- Great Deltoidal Icositetrahedron
- Great Dirhombicosidodecacron
- Great Dirhombicosidodecahedron
- Great Disdyakis Dodecahedron
- Great Disdyakis Triacontahedron
- Great Ditrigonal Dodecacronic Hexecontahedron
- Great Ditrigonal Dodecicosidodecahedron
- Great Ditrigonal Icosidodecahedron
- Great Dodecacronic Hexecontahedron
- Great Dodecadodecahedron
- Great Dodecahedron
- Great Dodecahedron-Small Stellated Dodecahedron Compound
- Great Dodecahemicosacron
- Great Dodecahemicosahedron
- Great Dodecahemidodecacron
- Great Dodecahemidodecahedron
- Great Dodecicosacron