|
|
|
Volumn 1, Issue , 1994, Pages 136-141
|
|
Turing completeness in the language of genetic programming with indexed memory
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
ALGORITHMS;
AUTOMATA THEORY;
COMPUTATIONAL COMPLEXITY;
COMPUTATIONAL METHODS;
COMPUTER PROGRAMMING LANGUAGES;
FORMAL LANGUAGES;
INDEXING (OF INFORMATION);
MATHEMATICAL MODELS;
STATE ASSIGNMENT;
TURING MACHINES;
GENETIC PROGRAMMING;
INDEXED MEMORY;
TURING COMPLETENESS;
MATHEMATICAL PROGRAMMING;
|
|
EID: 0028553346
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (46)
|
|
References (4)
|
