Abstract | ||
---|---|---|
The Calculus of Self-Modifiable Algorithms (CSA) is a universal theory that integrates different programming styles and may be applied to a wealth of domains and applications. This paper presents aspects of the Calculus of Self-Modifiable Algorithms and how it can be used in one area of Artificial Intelligence: Robot Plan Generation. |
Year | DOI | Venue |
---|---|---|
1993 | 10.1145/170791.170814 | ACM Conference on Computer Science |
Keywords | Field | DocType |
different programming style,universal theory,csa-based robot plan generator,artificial intelligence,robot plan generation,self-modifiable algorithms,artificial intelligent | Computer science,Theoretical computer science,Artificial intelligence,Robot | Conference |
ISBN | Citations | PageRank |
0-89791-558-5 | 2 | 0.40 |
References | Authors | |
3 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Van King Tan | 1 | 2 | 0.40 |
Eugeniusz Eberbach | 2 | 38 | 8.70 |