Barry Fagin

Learn More
In this paper, we describe a programmable emulator for the Princeton IAS/Von Neumann machine. The emulator is historically accurate, preserving the quirks and eccentricities of the machine. It is also user-friendly and robust, suitable for undergraduate architecture and programming classes as a teaching tool. Users can write non-trivial programs in IAS(More)
We present algorithms that permit increased efficiency in the calculation of conservation functions for cellular automata, and report results obtained from implementations of these algorithms to report conservation laws for 1-D cellular automata of higher order than any previously known. We introduce the notion of trivial and core conservation functions to(More)
We present theorems that can be used for improved efficiency in the calculation of conservation functions for cellular automata. We report results obtained from implementations of algorithms based on these theorems that show conservation laws for 1-D cellular automata of higher order than any previously known. We introduce the notion of trivial and core(More)
59 directly executed on the machine as written. Allowing for typographical errors, at least a few of them contain non-trivial bugs. Our emulator validated corrected versions of all the programs in the original IAS reports, 1-4,7 producing the expected results. A brief overview of how problems were solved on the IAS computer provides background for(More)
  • 1