(Enter summary)
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 statemachines. (Update)
Cited by: More
On Ontic Oracles and Epistemic Artificial Life Systems - Gopalakrishna (2005)
(Correct)
Active bibliography (related documents): More All
1.1: On Solving the System - GopalaKrishna, Bhattacharya
(Correct)
0.4: Super Turing-Machines - Copeland
(Correct)
0.4: Even Turing Machines Can Compute Uncomputable Functions - Copeland (1998)
(Correct)
Similar documents based on text: More All
0.6: Data-dependencies and Learning in Artificial Systems - GopalaKrishna
(Correct)
0.2: TranSquid: Transcoding and Caching Proxy for.. - Maheshwari, Sharma.. (2002)
(Correct)
0.2: Soft Word Sense Disambiguation - Ganesh Ramakrishnan Prithviraj (2004)
(Correct)
BibTeX entry: (Update)
Palem GopalaKrishna. A transformation framework for solving artificial life systems. Submitted to Evolutionary Computation, 2005. http://citeseer.ist.psu.edu/gopalakrishna05transformation.html More
@misc{ gopalakrishna05transformation,
author = "P. GopalaKrishna",
title = "A transformation framework for solving artificial life systems",
text = "Palem GopalaKrishna. A transformation framework for solving artificial
life systems. Submitted to Evolutionary Computation, 2005.",
year = "2005",
url = "citeseer.ist.psu.edu/gopalakrishna05transformation.html" }
Citations (may not include all citations):
299
Algebraic Theory of Processes (context) - Hennessy - 1988
229
Theory of Recursive Functions and Effective Computability (context) - Rogers - 2003
173
Quantum complexity theory
- Bernstein, Vazirani - 1997
137
Classical Recursion Theory (context) - Odifreddi - 1989
90
The Animat Path to AI
- Wilson - 1991
45
Zcs: a zeroth level classifier system
- Wilson - 1994
37
Universal Algebra for Computer Scientists (context) - Wechler - 1992
31
Systems of logic based on the ordinals (context) - Turing - 1939
30
Reversible Computing (context) - Toffoli - 1980
19
A Philosophical Essay on Probabilities (context) - Laplace - 1951
10
Infinite time turing machines (context) - Hamkins, Lewis - 1998
9
From Artificial Evolution to Artificial Life
- Taylor - 1999
9
On modelling life
- Adami - 1994
6
Deciding the undecidable (context) - Stewart - 1991
6
Beyond the universal turing machine
- Copeland, Sylvan - 1999
5
On alan turing's anticipation of connectionism
- Proudfoot - 1996
5
Four steps toward open-ended evolution
- Maley - 1999
5
Hyper computation: Computing more than the turing machine (context) - Ord - 2002
4
Artificial Life
- Bedau, Packard - 2000
3
Science of chaos or chaos in science
- Bricmont - 1995
2
Invertible cellular automata (context) - Toffoli, Margolus - 1936
2
Computability Theory An Introduction (context) - Jones - 1973
2
Mc Graw Hill Series in Information Processing and Computers (context) - Davis - 1958
2
Number Systems and the Foundations of Analysis (context) - Mendelson - 1973
1
Unconventional Models of Computation (context) - Copeland - 1998
1
Hidden determinism (context) - Primas - 2002
1
Zeno machines and hypercomputation (context) - Potgieter - 2004
1
Automata Studies (context) - De Leeuw, Moore - 2001
Documents on the same site (http://www.cse.iitb.ac.in/~krishna/): More
On Solving the System - GopalaKrishna, Bhattacharya
(Correct)
The Invalidity of Diagonalization Proof for Halting Problem - Em
(Correct)
On Ontic Oracles and Epistemic Artificial Life Systems - Gopalakrishna (2005)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC