Automatic Design of Algorithms Through Evolution (ADATE) is a system for automatic programming i.e., inductive inference of algorithms, which may be the best way to develop artificial and general intelligence. The ADATE system can automatically generate non-trivial and novel algorithms. Algorithms are generated through large scale combinatorial search that employs sophisticated program transformations and heuristics. The ADATE system is particularly good at synthesizing symbolic, functional programs and has several interesting qualities.

Examples of Specifications and Synthesized Programs

Even parity checking, Reversing a list, Duplicate checking ...

<http://www-ia.hiof.no/~rolando/>

Formal Methods and Artificial Intelligence

<http://l3awww.roma1.infn.it/~mirabell/>

Simplification of Boolean Functions

<http://134.193.15.25/vu/course/cs281/lectures/simplification/simplification.html>

OUTILS - TOOLS

Andreas W. Wieland

The CTAN macros/latex/contrib/karnaugh/ directory

Karnaugh maps and Veitch charts are used to simplify logic equations. The drawing of them used to be a boring, annoying and error-prone task. With the included macros this is no longer a problem. They can typeset Karnaugh maps and Veitch charts with up to ten variables, which is more than you might likely need. You only have to provide a list of variable identifiers plus the function table of your logic function(s). The macros also allow to mark the simplifications of your logic function directly within a Karnaugh map or Veitch chart.

<http://www.ctan.org/tex-archive/macros/latex/contrib/karnaugh/>

THÉORIE - THEORY

Intrinsic Gap Modes in One-Dimensional Diatomic Lattices

S. A. Kiselev, S. R. Bickham and A. J. Sievers

<http://www.lassp.cornell.edu/~sievers/ilm/igm1d/index.html>

DOCUMENTS - PAPERS

Boolean Properties of Sets

Boolean Properties of Lattices

Agnieszka Julia Marasik Warsaw University Bialystok

<http://mizar.org/JFM/Vol1/boole.html>

COURS - COURSES

<http://www.blois.univ-tours.fr/~marcel/archi/node56.html>

MANUELS - MANUALS

BDSYN Users' Manual

Bdsyn is a tool for quickly describing and implementing combinational logic. It allows the user to describe a circuit function and produce an implementation of that circuit automatically.

Ronny H. Kavli

<http://www.ludd.luth.se/users/kavli/bdsyn.html>

LIENS - LINKS

<liens_math.html>

Advertising : If you see a reference in one of the files that is not linked, and you know of a link address to the appropriate document, please send me mail, and I will include the link in the document. Thanks very much in advance.
Avertissement : Le classement par catégories est approximatif. Certains liens se retrouvent dans des rubriques différentes et sur plusieurs pages. Les commentaires sont généralement des courts extraits des pages référencées. Il est possible que certains liens nécessitent une mise à jour.
Tous commentaires ou remarques sont les bienvenus, vous pouvez les adresser à :
écrire

Les mises à jour demandées sont réalisées dès que possible et, sauf si c'est nécessaire, aucun message de réponse n'est expédié. Merci de m'écrire.

Copyright © 1999-2012 Jean-Paul Davalan - Reproduction interdite.