## Christopher PhoumsavanhChris Phoumsavanh is an undergraduate student studying for his BE in mechatronics and robotics and BS in computer science and software engineering at Swinburne University of Technology in Melbourne, Australia. He is expecting to graduate in 2010, and his time at the university is being supported by the Vice Chancellor's Scholarship in Engineering. As part of his university studies, he has spent time at the Defence Science and Technology Organisation (DSTO) investigating acoustic electric feedthrough communications and powering. His time at DSTO was supported by the DSTO Industry Experience Program. He has attended similar summer schools, including the 32nd Professor Harry Messel International Science School (ISS2003), the 33rd ISS (ISS2005, as staff), and the 8th China Synergy Programme for Outstanding Youth (CSP8). Partial Solutions to the "Firing Squad Synchronisation Problem" using NKS The "Firing Squad Synchronisation Problem" (FSSP) is a cellular automata (CA) problem first proposed by John Myhill in 1957. A solution was first found in the early 1960s. To understand the FSSP, consider the following scenario: Consider a line
(of arbitary length) of finite state machines known as "soldiers", which at This project aims to use NKS principles to find partial solutions to the FSSP. For the purposes of this project, a partial solution is defined as a CA where all the soldiers reach the fire state though not necessarily simultaneously. A metric for how well a partial solution performs is the number of time steps required for all the soldiers to reach the fire state after any single soldier enters it. Another performance metric is how many soldiers reach the fire state, as it is not known whether all CAs will evolve to the point where all soldiers fire. Additionally, a metric may also be developed involving mapping the time differential versus the number of soldiers fired, on a two-dimensional graph. Rule 1494957704718 |