ToL: A Tensor of List-Based Unified Computation Model
Preprint
Abstract
Previous computation models either have equivalent abilities in representing all computations but fail to provide primitive operators for programming complex algorithms or lack generalized expression ability to represent newly-added computations. This article presents a unified computation model with generalized expression ability and a concise set of primitive operators for programming high-level algorithms. We propose a unified data abstraction -- Tensor of List, and offer a unified computation model based on Tensor of List, which we call the ToL model (in short, ToL). ToL introduces five atomic computations that can represent any elementary computation by finite composition, ensured with strict formal proof. Based on ToL, we design a pure-functional language -- ToLang. ToLang provides a concise set of primitive operators that can be used to program complex big data and AI algorithms. Our evaluations show ToL has generalized expression ability and a built-in performance indicator, born with a strictly defined computation metric -- elementary operation count (EOPs), consistent with FLOPs within a small error range.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- On the Expressive Power of Query Languages for MatricesACM Transactions on Database Systems, 2019
- Arithmetic Circuits: A Survey of Recent Results and Open QuestionsFoundations and Trends® in Theoretical Computer Science, 2010
- The LINPACK Benchmark: past, present and futureConcurrency and Computation: Practice and Experience, 2003
- Genetic K-means algorithmIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1999
- A gentle introduction to HaskellACM SIGPLAN Notices, 1992
- Studying artificial life with cellular automataPhysica D: Nonlinear Phenomena, 1986
- A relational model of data for large shared data banksCommunications of the ACM, 1970