Relating Uniform and Nonuniform Models of Computation

Abstract

We relate uniform and nonuniform models of computation on a semantical level. As a we use uniform model/a universal language based on recursive definitions over arbitrary data structures. Nonuniform models are represented by “term definitions” which describe functions by families of terms. We find the term definition inside a program, called calculation function, and show that exactly the recursive functions have recursive term definitions which can be realized as calculation functions. We give the examples of matrix multiplication and binary search to prove our concepts appropriate.