public:t720-atai-2012:area
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
public:t720-atai-2012:area [2013/07/24 01:03] – thorisson | public:t720-atai-2012:area [2024/04/29 13:33] (current) – external edit 127.0.0.1 | ||
---|---|---|---|
Line 6: | Line 6: | ||
====== The AERA System ====== | ====== The AERA System ====== | ||
- | The Auto-catalytic Endogenous Reflective Architecture – AERA – is a new AGI-aspiring | + | The Auto-catalytic Endogenous Reflective Architecture – AERA – is an AGI-aspiring |
- | + | ||
- | A key principle of AERA operation is that of a **production** cycle: Each program in AERA has a level of **activation** that determines if it is allowed to run or not. Every piece of data has a corresponding **saliency** level that determines if it is visible or not inside the system. In AERA there is a single memory, but it (typically) embeds groups that allow sets of data and programs to be addressed, e.g. changing their activation, saliency, or existence (via creation or deletion). | + | |
AERA's knowledge is stored in models, which essentially encode transformations on input, to produce output. Models have a trigger side (left-hand side) and a result side (right-hand side). In a forward-chaining scenario, when a particular piece of data matches on the left hand of a model (it is only allowed to test the match if the data has high enough saliency and the program has sufficient activation) the model fires, producing the output specified by its left-hand side and // | AERA's knowledge is stored in models, which essentially encode transformations on input, to produce output. Models have a trigger side (left-hand side) and a result side (right-hand side). In a forward-chaining scenario, when a particular piece of data matches on the left hand of a model (it is only allowed to test the match if the data has high enough saliency and the program has sufficient activation) the model fires, producing the output specified by its left-hand side and // | ||
- | In a backward chaining | + | In backward-chaining |
+ | |||
+ | A key principle of AERA operation is that of a **distributed production** process: Each program in AERA has a level of **activation** that determines if it is allowed to run or not. Every piece of data has a corresponding **saliency** level that determines how visible it is inside the system. In AERA there is a single memory, but it (typically) embeds groups that allow sets of data and programs to be addressed, e.g. changing their activation, saliency, or existence (via creation or deletion). | ||
Behind this system lie five main design principles: | Behind this system lie five main design principles: | ||
Line 23: | Line 23: | ||
==== Replicode ==== | ==== Replicode ==== | ||
- | The programming language of AERA, **Replicode**, | + | The programming language of AERA, **Replicode**, |
- Syntax and semantics meant for humans | - Syntax and semantics meant for humans | ||
- Inefficiencies in execution stemming from item 1 | - Inefficiencies in execution stemming from item 1 | ||
- Lack of support for induction and abduction as first-class logical operations | - Lack of support for induction and abduction as first-class logical operations | ||
- | - Lack of ability to model own behavior, at a high level of detail | + | - Lack of ability to model own behavior, at fine levels |
- Lack of ways to handle passage and representation of (external and internal) time | - Lack of ways to handle passage and representation of (external and internal) time | ||
- Lack of support for self-generated code | - Lack of support for self-generated code | ||
- | Replicode addresses all of these, and exhibits therefore the following unique features: | + | Replicode |
* Machine-readable operational semantics | * Machine-readable operational semantics | ||
Line 40: | Line 40: | ||
* Direct support for unified logical operations: induction, deduction, abduction | * Direct support for unified logical operations: induction, deduction, abduction | ||
* Extremely fast logical and distributed operations execution | * Extremely fast logical and distributed operations execution | ||
+ | * Bijective compilation: | ||
Replicode has the following distinguishing features: | Replicode has the following distinguishing features: | ||
Line 52: | Line 53: | ||
* Designed to handle a vast amount of parallel processing tasks | * Designed to handle a vast amount of parallel processing tasks | ||
- | While some – or possibly //all// – of these features may be found in the singular, or possibly in pairs, in other programming languages, we are pretty sure no current programming language embodies them //all//. They are //all// needed to achieve what was envisioned with the AERA architecture, | + | While some – or possibly //all// – of these features may be found in the singular, or possibly in pairs, in other programming languages, we are pretty sure no current programming language embodies them //all in one and the same system//. They are //all// needed to achieve what was envisioned with the AERA architecture, |
==== AERA ==== | ==== AERA ==== |
/var/www/cadia.ru.is/wiki/data/attic/public/t720-atai-2012/area.1374627809.txt.gz · Last modified: 2024/04/29 13:33 (external edit)