Mateja Verlic graduated from the University of Maribor with a BSc in computer science. She is a programmer (and a bit of an artist by heart) and currently working on her PhD as a research assistant in the Laboratory for System Design at the Faculty of Electrical Engineering and Computer Science (University of Maribor). In 2005 she attended EASSS (Seventh European Agent Systems Summer School). She published some papers at international conferences and contributed to the chapter on software agents in the Wiley Encyclopedia of Biomedical Engineering (2006). Her interests include machine learning, software agents and recently e-learning and its application for people with special needs.
Project: Complexity and growth rates in cyclic tag systems
Cyclic tag systems (CTSs) are another example of how simple initial conditions can produce complex behavior. Looking at the lengths of sequences in the process of evolving CTS, complexity is present–at least to some degree–in the fluctuations in growth of sequences. These fluctuations are in many aspects random–which indicates that the growth behavior of cyclic tag systems is worth investigating. Some questions to be answered:
- Is the growth of CTS bounded?
- Are the fluctuations in growth (differences in lengths of sequences) bounded?
- What kind of growth rates can be found?
- Search for complexity in cyclic tag systems
- Investigate growth rates in cyclic tag systems
- Define classes of growth behavior that can occur
- Search for logarithmic growth rate
- Search for growth rate close to square root
Favorite Four-Color, Radius-1/2 Rule
Rules chosen: 149157293 and 1316931385 and 2481733883
There are at least three people (should I rather say beings?) that I like most… me, myself and I 🙂 If I picked out just one favorite CA (for myself), other two (I & me) might complain. Therefore I had to choose three.
Why these three? Because they’re supercalifragilisticexpialidocious, that’s why. 🙂