## A Transformation Framework for Solving Artificial Life Systems (2005)

Citations: | 1 - 1 self |

### BibTeX

@MISC{GopalaKrishna05atransformation,

author = {Palem GopalaKrishna},

title = {A Transformation Framework for Solving Artificial Life Systems },

year = {2005}

}

### OpenURL

### Abstract

Mathematically a system is said to be solved if its future states can be predicted from the information provided by the present and past state history. In this paper, we examine the problem of solving Artificial Life systems using the principles of state-machines The.

### Citations

1326 | On computable numbers with an application to the Entscheidungsproblem - Turing - 1935 |

896 | Jr.; Theory of Recursive Functions and Effective Computability - Rogers - 1987 |

499 | Quantum Complexity Theory - Bernstein, Vazirani - 1997 |

416 | Algebraic Theory of Processes - Hennessy - 1988 |

326 | Classical Recursion Theory - Odifreddi - 1989 |

134 | Systems of logic based on ordinals - Turing - 1939 |

123 |
Computability and Unsolvability
- Davis
- 1982
(Show Context)
Citation Context ... followed by a list of references. In Appendix A, we provide formal definitions for several of the terms we use throughout this report. These notions have been adapted from classical sources such as (=-=Davis, 1958-=-; Jones, 1973), and a detailed understanding of these formal definitions is necessary for a real comprehension of the constructions and theorems presented in section 3. 2 Solving the System When a sys... |

103 | A Philosophical Essay on Probabilities - Laplace - 1951 |

84 | Innite time Turing machines, The - Hamkins, Lewis - 2000 |

35 | Hypercomputation: computing more than the Turing machine, Honours Thesis - Ord - 2002 |

27 |
Invertible Cellular Automata
- Toffoli, Margolus
- 1990
(Show Context)
Citation Context ... would be more convenient and useful to trace the search backwards, from the state-of-interest to the present state. Reversible finite deterministic systems such as those described in (Toffoli, 1980; =-=Toffoli and Margolus, 1990-=-) allow us to carry out this kind of backward searches also. With this search procedure a program can now detect the absence of a state. Typically when a state is not present on the transition path, t... |

26 | From artificial evolution to artificial life - Taylor - 1999 |

20 | On modeling life - Adami - 1994 |

19 | Science of chaos or chaos - Bricmont - 1995 |

19 | Four steps toward open-ended evolution
- Maley
- 1999
(Show Context)
Citation Context ...t, for the natural systems are doing no better than that. In Maley’s terms, ”Much of the modern life is single celled and its complexity probably hasn’t changed much over the last few billion years” (=-=Maley, 1999-=-). But then, it would be too early to draw conclusions about real systems based on the observations made from the study of models alone, for on ontic scale a model tells us nothing about the system wh... |

12 | On Alan Turing’s Anticipation of Connectionism. Synthese - Copeland, Proudfoot - 1996 |

12 | The animat path to - Wilson - 1991 |

6 | Number Systems and the Foundations of Analysis - Mendelson - 1973 |

5 | Zeno machines and hypercomputation - Potgieter - 2006 |

4 | Deciding the Undecidable. Nature - Stewart - 1991 |

3 | Unconventional Models of Computation, chapter Even Turing Machines Can Compute Uncomputable Functions - Copeland - 1998 |

3 |
Hidden determinism, probability, and time’s arrow
- Primas
- 2002
(Show Context)
Citation Context ...ut-output system is represented by kind of memory. It represents the minimal amount of information about the past history of the system which suffices to predict the effect of past upon the future.” (=-=Primas, 2002-=-) This idea is known in a more philosophical terminology as the Laplacian demon, referring to an ideal demon, which, knowing precisely the current state of a system, can foresee the exact development ... |

1 | 12 Evolutionary Computation Volume x, Number x Framework for Solving Artificial Life Systems - Copeland, Sylvan - 1999 |

1 |
Computability Theory An Introduction
- Jones
- 1973
(Show Context)
Citation Context ...a list of references. In Appendix A, we provide formal definitions for several of the terms we use throughout this report. These notions have been adapted from classical sources such as (Davis, 1958; =-=Jones, 1973-=-), and a detailed understanding of these formal definitions is necessary for a real comprehension of the constructions and theorems presented in section 3. 2 Solving the System When a system is viewed... |

1 | Automata Studies, chapter Computability by probabilistic machines - Leeuw, Moore, et al. - 2001 |

1 |
Open-ended artificial evolution
- Russell
- 2003
(Show Context)
Citation Context ...er words, no program can ever really display an open-ended artificial evolution. This observation might provide an answer for the apparent lack of complexity increase in Tierra reported by Russel in (=-=Russell, 2003-=-). However, this is not as disappointing as we might take it to be at first, for the natural systems are doing no better than that. In Maley’s terms, ”Much of the modern life is single celled and its ... |

1 | Evolutionary Computation Volume x, Number x 13 P.GopalaKrishna - Wechler - 1992 |