The Function-Representation Model of Computation

TL;DR

This paper introduces the Function-Representation model of computation, merging memory and program to address knowledge retrieval issues in cognitive architectures, supported by mathematical proofs and organizational strategies.

Contribution

It proposes a novel unified computation model that integrates memory and program, with formal definitions and exploration of its functional capabilities.

Findings

Mathematical definitions and proofs of the Function-Representation model

Analysis of functions implementable by the model

Different organizational strategies for multiple instances

Abstract

Cognitive Architectures are the forefront of the research into developing an artificial cognition. However, they approach the problem from a separated memory and program model of computation. This model of computation poses a fundamental problem: the knowledge retrieval heuristic. In this paper we propose to solve this problem by using a novel model of computation, one where memory and program are merged: the Function-Representation. This model of computation involves defining a generic Function-Representation and instantiating multiple instances of it. In this paper we explore the potential of this novel model of computation through mathematical definitions and proofs. We also explore the kind of functions a Function-Representation can implement, and present different ways to organise multiple instances of a Function-Representation.