Accueil
Plan du site
Bloc notes
Jeux
Graphes
Combinatoire
Arithmétique
Algèbre
Analyse
Probabilités
Automates
Programmation
Divers
Liens
Home
Plan du site
Bloc notes
Jeux
Graphes
Combinatoire
Arithmétique
Algèbre
Analyse
Probabilités
Automates
Programmation
Divers
Liens
Home
Alan Turing
| SOMMAIRE | Pages Web | Associations | Pages Personnelles | Demos | Exemples | Dictionnaires |
| Logiciels | Utilitaires | Simulations | ThÈses | Sujets | Papiers | Cours | Tutoriels |
| Historiques | Biographies | Archives | Liens | Moteurs de recherche |
| Logiciels | Utilitaires | Simulations | ThÈses | Sujets | Papiers | Cours | Tutoriels |
| Historiques | Biographies | Archives | Liens | Moteurs de recherche |
PAGES WEB
Page de liens
<liens_lang.html>
Page de liens
<liens_automates.html>
Page de liens
<liens_bison.html>
Page de liens
<liens_grammar.html>
These web pages were put together for a first year computer science project at the University of Sheffield. The theme of this project is Alan Turing, who was one of the first computer scientists. We have put together a description of some of his works along with a short biography. This was a joint project by 5 students, a little more about us can be found in the credits page.
<http://www.dcs.shef.ac.uk/~u6rs/turing/>
<http://vlmp.museophile.com/computing.html>
<http://www.turing.org.uk/turing/scrapbook/memorial.html>
<http://www.research.att.com/~njas/sequences/indexfr.html#A>
Stanford Encyclopedia of Philosophy
<http://plato.stanford.edu/entries/church-turing/>
R. Knott
<http://www.mcs.surrey.ac.uk/Personal/R.Knott/mathematicians.html#turing>
Jack Copeland and Gordon Aston
was written by Alan Turing in 1936. Proceedings of the London Mathematical Society, 42, pp. 230-265,1936 tp2-ie.pdf
<http://www.abelard.org/turpap2/tp2-ie.asp>
<http://cogsci.ucsd.edu/%7easaygin/tt/ttest.html>
[Cet article a été publié pour la première fois par Scott Aaronson sous le nom Who Can Name The Bigger Number ? sur son propre site et est traduit et publié ici avec l'aimable autorisation de l'auteur.]
<http://blog.smwhr.net/2007/09/30/la-course-aux-grands-nombres/>
ASSOCIATIONS
Maintained by Andrew Hodges, author of Alan Turing: the Enigma.
Who was Alan Turing? Founder of computer science, mathematician, philosopher, codebreaker, strange visionary and a gay man before his time:
<http://www.turing.org.uk/turing/>
PAGES PERSONNELLES - HOME PAGES
University of Waterloo Ontario Canada
<http://www.math.uwaterloo.ca/~shallit/>
Maintained by Andrew Hodges,
<p://www.turing.org.uk/turing/>
<http://iew3.technion.ac.il/Home/Users/FIRST.phtml?show+Hava+Siegelmann>
DEMOS
<http://cgi.student.nada.kth.se/cgi-bin/d95-aeh/get/turingeng> <http://www.nmia.com/~soki/turing/form.html>
EXEMPLES - EXAMPLES
<http://www.ams.org/new-in-math/cover/turing.html>
DICTIONNAIRES GLOSSAIRES - DICTIONARIES
Turing Machine
<http://plato.stanford.edu/entries/turing-machine/>
LOGICIELS - SOFTWARES
is a graphical IDE that you may use to edit and play with Turing machines.
Cheran Software SRL
<http://www.cheransoft.com/vturing/>
Turing is a structured programming language,
which is easy to learn and best suited for teaching computer concepts.
<http://www.utoronto.ca/license/detail/turing.htm>
Alex Vinokur - ANALYSIS of ALGORITHMS Bulletin Board Page
<http://semillon.wpi.edu/~aofa/AofA/msg00020.html>
OUTILS - TOOLS
Robert Munafo
<http://home.earthlink.net/~mrob/pub/perl/turing.txt>
SIMULATIONS
Jean-Côme Charpentier
<http://melusine.eu.org/syracuse/texpng/turing/doc_turing.xml>
THÈSES - THESIS
Franck Guingne Rouen, LIFAR, juin 2005
<http://franck.guingne.free.fr/publications.html>
SUJETS - SUBJECTS
Machines Related to Busy Beaver Competitions, Spring '95, '96:
<http://www.rpi.edu/~brings/SL/tms.html>
Penousal Machado and Francisco B. Pereira
<http://eden.dei.uc.pt/~machado/BB.html>
<http://www-csli.stanford.edu/hp/Beaver.html>
Michael Somos
<http://grail.cba.csuohio.edu/~somos/bb.html>
A.K.Dewdney Scientific American, Apr 1985, p. 30
<http://grail.cba.csuohio.edu/~somos/busy.html>
<http://www.nmia.com/~soki/turing/>
<http://www.drb.insel.de/~heiner/BB/index.html>
<http://home.earthlink.net/~mrob/pub/math/largenum-4.html#beaver>
Laplace, Turing and the "imitation game" impossible geometry: randomness, determinism and programs in Turing's test.
publications by Giuseppe Longo
(3 - Morphological Information and Complexity: turing-jeu.pdf)
<http://www.di.ens.fr/users/longo/download.html>
DOCUMENTS - PAPERS
Proposal for the Development in the Mathematics Division of an Automatic Computing Engine (ACE)
Turing A. Executive Committee National Physical Laboratory (HMSO) : 1-20, 1945.
<http://www.emula3.com/docs/Turing_Report_on_ACE.pdf>
By A. M. Turing
On the site of Hugh Gene Loebner
<http://loebner.net/Prizef/TuringArticle.html>
<http://plato.stanford.edu/entries/church-turing/>
<http://plato.stanford.edu/entries/turing-machine/>
<http://www.cs.utoronto.ca/~neto/contest/uticpc1997-2/html/node2.html>
<http://ase.isu.edu/ase01_07/ase01_07/bookcase/ref_sh/foldoc/37/112.htm>
Pedro Rodrigues1, J. Félix Costa2, and Hava T. Siegelmann3
In the beginning of the nineties, Hava Siegelmann proposed a new computational model, the Artificial Recurrent Neural Network (ARNN), and proved that it could perform hypercomputation. She also established the equivalence between the ARNN and other analog systems that support hypercomputation, launching the foundations of an alternative computational theory. In this paper we contribute to this alternative theory by exploring the use of formal methods in the verification of temporal properties of ARNNs.
<http://link.springer-ny.com/link/service/series/0558/bibs/2084/20840158.htm>
Turing provided a hypothesis to explain the generation of pattern when smooth sheet of cells develop pattern during development in a wide variety of settings including the formation of leaf buds, florets, skin markings, and limbs. According to this hypothesis, chemicals called morphogens generate organs when present in sufficient density, and the pattern is created through mechanisms of reaction and diffusion.
Jonathan Swinton
<http://homepage.ntlworld.com/j.swinton1/jonathan/Turing/rdintro.htm>
23 pages to appear in "Quantum Information Processing"
Is there any hope for quantum computing to challenge the Turing barrier, i.e. to solve an undecidable problem, to compute an uncomputable function?
<http://arxiv.org/abs/quant-ph/0112087>
by Mark Sapir - Group Theory February 2006 - eprint arXiv:math.GR/0602215
<http://front.math.ucdavis.edu/math.GR/0602215>
COURS - COURSES
John McCarthy 1961-1963
This 1963 paper was included in Computer Programming and Formal Systems, edited by P. Braffort and D. Hirshberg and published by North-Holland.
<http://www-formal.stanford.edu/jmc/basis1/basis1.html>
<http://www.campusprogram.com/reference/en/wikipedia/r/ri/rice_s_theorem.html>
TUTORIELS - TUTORIALS - TUTORS
<http://www.netaxs.com/people/nerp/automata/syllabus.html>R. E. Newman-Wolfe, University of Florida
<http://www.cis.ufl.edu/~nemo/cot6315/tm.html>
HISTORIQUES - HISTORY
23 June 1912 - 7 June 1954
School of Mathematics and Statistics, University of St Andrews, Scotland
<http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Turing.html>
BIOGRAPHIES
By Jack Copeland
<http://www.cs.usfca.edu/www.AlanTuring.net/turing_archive/pages/Reference%20Articles/Bio%20of%20Alan%20Turing.html>
2 June 1895 - 12 Dec 1965
<http://www-gap.dcs.st-and.ac.uk/~history/Mathematicians/Rado.html>
ARCHIVES
Turing, Alan Mathison (1912-1954) FRS OBE
This digital archive contains mainly unpublished personal papers and photographs of Alan Turing from 1923-1972. The originals are in the Turing archive in King's College Cambridge. This is a pilot project which will hopefully be extended to the whole collection in the future.
<http://www.turingarchive.org/index.html>
LIENS - LINKS
<http://www.bvu.edu/~daveh/dhturing.html>
MOTEURS DE RECHERCHE - SEARCH
<http://www.britannica.com/search?query=Turing&ct=>
| SOMMAIRE | Pages Web | Associations | Pages Personnelles | Demos | Exemples | Dictionnaires |
| Logiciels | Utilitaires | Simulations | ThÈses | Sujets | Papiers | Cours | Tutoriels |
| Historiques | Biographies | Archives | Liens | Moteurs de recherche |
| Logiciels | Utilitaires | Simulations | ThÈses | Sujets | Papiers | Cours | Tutoriels |
| Historiques | Biographies | Archives | Liens | Moteurs de recherche |
| Accueil | Plan du site | Bloc notes | Jeux | Graphes | Combinatoire | Arithmétique | Algèbre |
| Analyse | Probabilités | Automates | Informatique | Divers | Lycée |
| Analyse | Probabilités | Automates | Informatique | Divers | Lycée |
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 à :
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.
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 à :
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.