Table of Contents
Fetching ...

The Function-Representation Model of Computation

Alfredo Ibias, Hector Antona, Guillem Ramirez-Miranda, Enric Guinovart, Eduard Alarcon

TL;DR

This paper proposes to solve the knowledge retrieval heuristic problem by using a novel model of computation, one where memory and program are merged: the Function-Representation, and explores the potential of this novel model of computation through mathematical definitions and proofs.

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.

The Function-Representation Model of Computation

TL;DR

This paper proposes to solve the knowledge retrieval heuristic problem by using a novel model of computation, one where memory and program are merged: the Function-Representation, and explores the potential of this novel model of computation through mathematical definitions and proofs.

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.

Paper Structure

This paper contains 11 sections, 14 theorems, 1 equation.

Key Result

Theorem 1

Given two sets $I$ and $O$ and a function $f: I \to O$. Let $\xi_I$ be a random variable over $I$ such that it induces a uniform probability distribution $\sigma_{\xi_I}$, then the function $f$ transforms $\xi_I$ into a random variable $\xi_O$ over the set $O$ such that it induces another probabilit

Theorems & Definitions (35)

  • Definition 1
  • Theorem 1
  • proof
  • Theorem 2
  • proof
  • Theorem 3
  • proof
  • Definition 2
  • Theorem 4
  • proof
  • ...and 25 more