The%20Matrix%20Model%20of%20Computation%20(MMC) - PowerPoint PPT Presentation

About This Presentation
Title:

The%20Matrix%20Model%20of%20Computation%20(MMC)

Description:

sx = rx tg. th = tb te. wy = vy tk. ti = tc tf ... Transformations, refactorings. Formal algorithms. Training modes. The Scope Constriction Algorithm ... – PowerPoint PPT presentation

Number of Views:33
Avg rating:3.0/5.0
Slides: 12
Provided by: sergiopis
Category:

less

Transcript and Presenter's Notes

Title: The%20Matrix%20Model%20of%20Computation%20(MMC)


1
The Matrix Model of Computation(MMC)
Sergio Pissanetzky
2
  • The MMC consists of two sparse matrices
  • M (C, Q)
  • C Matrix of Services
  • Q Matrix of Sequences
  • The model has two forms
  • ? imperative form
  • ? canonical form

3
PROGRAM
tc tj tf tk tb te tl ta td wz tg wx sx th wy ti sz sy
DATA
tc a fz
tj b fx
tf d vz
tk b fy
tb a fy
te d vy
tl b fz
ta a fx
td d vx
wz vz tl
tg ta td
wx vx tj
sx rx tg
th tb te
wy vy tk
ti tc tf
sz rz ti
sy ry th
C
C
C
C
C
C
C
C
C
A C
A A C
A C
A C
A A C
A C
A A C
A C
A C
a, fz
b, fx
d, vz
b, fy
a, fy
d, vy
b, fz
a, fx
d, vx
vz

vx
rx

vy

rz
ry
4
The MMC is simple, yet very rich in features
Universal Natural ontology
Mathematically formal Dynamic mode
Turing equivalent Self organizing
Quantum equivalent Connectionist
Relational database Massively parallel
Computer program Data channel
Algebra of operations Transformations, refactorings
Formal algorithms Training modes
5
The Scope Constriction Algorithm (SCA)
6
tc tj tf tk tb te tl ta td wz tg wx sx th wy ti sz sy
Profile of matrix C
C
C
C
C
C
C
C
C
C
A C
A A C
A C
A C
A A C
A C
A A C
A C
A C
7
tc tj tf tk tb te tl ta td wz tg wx sx th wy ti sz sy
Data channel
C
C
C
C
C
C
C
C
C
A C
A A C
A C
A C
A A C
A C
A A C
A C
A C
Turbulent flow
8
tc tj tf tk tb te tl ta td wz tg wx sx th wy ti sz sy
Service Commutation
C
C
C
C
C
C
C
C
C
A C
A A C
A C
A C
A A C
A C
A A C
A C
A C
9
td ta tg sx tj wx te tb th sy tk wy tf tc ti sz tl wz
PROGRAM
DATA
C
C
A A C
A C
C
A C
C
C
A A C
A C
C
A C
C
C
A A C
A C
C
A C
td d vx
ta a fx
tg ta td
sx rx tg
tj b fx
wx vx tj
te d vy
tb a fy
th tb te
sy ry th
tk b fy
wy vy tk
tf d vz
tc a fz
ti tc tf
sz rz ti
tl b fz
wz vz tl
d, vx
a, fx

rx
b,fx
vx
d, vy
a, fy

ry
b, fy
vy
d, vz
a, fz

rz
b, fz
vz
G
Laminar flow
H
G
H
G
H
10
The refactored code
G gx
sx gx.go(a, d, fx, rx, vx)
H hx
wx hx.go(b, fx, vx)
G gy
sy gy.go(a, d, fy, ry, vy)
H hy
wy hy.go(b, fy, vy)
G gz
sz gz.go(a, d, fz, rz, vz)
H hz
wz hz.go(b, fz, vz)
Where did the objects come from?
11
CONCLUSIONS AND OUTLOOK
? Objects and inheritance occur naturally in systems. They can be revealed by the SCA algorithm.

? Impact on Computer Science, Software Engineering, Refactoring, the Semantic Web, Artificial Intelligence, Biology, Neuroscience, Linguistics.

? Conjecture Our mind uses the same process to make objects.

Write a Comment
User Comments (0)
About PowerShow.com