BrainFights vs Multitape Turing Machine

«Brain Fights» is a new educational application, which develops effectively arithmetic skills, especially skills in mental arithmetic. The program is designed not only for the "mathematicians", but also for everyone, who has a desire positively to change his lifestyle in the foreseeable future! This happens because friendship with figures restores the order in the head and have a positive effect on the image in the eyes of others. The core of the project «Brain Fights» is to use simple for understanding algorithms during the mental arithmetic. The application consists of some teaching lessons (with an increasing complexity) and practical lessons, where you have to pass the tests. It means that the work is based on the principle of training simulator. You will easily learn how to subtract 7,8,9, to multiply by 4, and by 8, to multiply by 9, by 11 and by 25 and much more. You will do it quickly and in your mind. Key features of Brain Fights: - Effectively built training system; - A great amount of different techniques and tricks; - There is a motivation to train (the points let the next lessons be open); - Game Center — the users can compete with each other and share "challenges"; - Convenience and simplicity in everyday use. With the application "Brain Fights" anyone can "pump" his own math skills of the brain. According to our statistics, 7 days of regular practice help to increase mental skills in math in 10 times! In addition, the numbers are a sort of a therapy for the development of the intellect, which has a positive effect at many, if not at all, aspects of a human life. «Brain Fights» is a really useful project, which is already today available for downloading at iPhone and iPad. And if you like it give us 5 stars!

Multitape Turing Machine Simulator. A Turing machine is a mathematical model of computation describing an abstract machine, that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, it is capable of implementing any computer algorithm. The machine operates on a memory tape divided into cells, each of which can hold a single symbol drawn from symbols from the alphabet of the machine. It has a "head" that, at any point in the machine's operation, is positioned over one of these cells, and a "state" selected from a set of states. At each step of its operation, the head reads the symbol in its cell. Then, based on the symbol and the machine's own present state, the machine writes a symbol into the same cell, and moves the head one step to the left or the right, or halts the computation. The choice of which replacement symbol to write and which direction to move is based on a table that specifies what to do for each combination of the current state and the symbol that is read. Suggestions: snowlukin@gmail.com