Qualitatively matching Computer Architecture with Turing Machine Jean-Louis Lafitte* Swiss Federal Institute of Technology Introduction and Objectives Computer Science has been developed around the concept of algorithm, such is the case of the central computing a u t o m a t a known as processors and idealized as Taring Machines. On the other hand, computer engineering has been developing a lot of technical ideas in order to implement such a machine and mostly to optimize its usage of hardware resources. These technical ingeniosities have collectively been called architecture. This s t u d y a t t e m p t s to insert computer architecture along with the algorithmic part handled by a Turing machine. From then on, some geometric elements are exploited to relate the behavior of an algorithm (within a Turing machine) as relative to the considered architecture. In so doing, we start to qualify the use, by an algorithm, of a computer architecture. We are proposing a conjecture regarding the required capacity of an architecture in order to absorb the irregularity in accessing d a t a of a given algorithm. Let us first briefly review a Turing Machine as envisioned in Computer
/lp/association-for-computing-machinery/qualitatively-matching-computer-architecture-with-turing-machine-pSKcKLrNZB