<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jongwane, Joanna</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">À la découverte des automates cellulaires</style></title><secondary-title><style face="normal" font="default" size="100%">Interstices</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Algorithme et structure de données</style></keyword><keyword><style  face="normal" font="default" size="100%">Algorithmes</style></keyword><keyword><style  face="normal" font="default" size="100%">Apprentissage</style></keyword><keyword><style  face="normal" font="default" size="100%">Complexité</style></keyword><keyword><style  face="normal" font="default" size="100%">conception objet</style></keyword><keyword><style  face="normal" font="default" size="100%">Creative Commons</style></keyword><keyword><style  face="normal" font="default" size="100%">Découvrir</style></keyword><keyword><style  face="normal" font="default" size="100%">Informatique</style></keyword><keyword><style  face="normal" font="default" size="100%">Invariance</style></keyword><keyword><style  face="normal" font="default" size="100%">langage</style></keyword><keyword><style  face="normal" font="default" size="100%">Logique</style></keyword><keyword><style  face="normal" font="default" size="100%">Mathématiques</style></keyword><keyword><style  face="normal" font="default" size="100%">Mathématiques inductives déductives</style></keyword><keyword><style  face="normal" font="default" size="100%">Programmation algorithmique</style></keyword><keyword><style  face="normal" font="default" size="100%">programmes</style></keyword><keyword><style  face="normal" font="default" size="100%">similitude (TIPE 2012-2013)</style></keyword><keyword><style  face="normal" font="default" size="100%">Théorie et langage formel</style></keyword><keyword><style  face="normal" font="default" size="100%">Vivant</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2007</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://interstices.info/automates-intro</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Explorer les relations mathématiques entre les phénomènes observés chez des êtres vivants et des machines, c’est là l’une des possibilités offertes par les automates cellulaires.</style></abstract></record></records></xml>