Wesselkamper, Thomas C.2013-06-192013-06-191975http://hdl.handle.net/10919/20203The paper reviews the Shannon and Reed-Muller Decomposition Theorems and notes the relationship of the former to machine instruction set. It hypothesizes an instruction set based on Galois field operations and applies the divided difference methods of Newton to the automatic generation of a polynomial representation of an arbitrary function. Some numeric results are given for the fields GF(9) and GF(16). An extension of the methods to the representation of functions by rational forms is suggested.application/pdfenIn CopyrightTechnical reportCS75015-Rhttp://eprints.cs.vt.edu/archive/00000796/01/CS75015-R.pdf