Javascript doit fonctionner ! Activez-le et rechargez cette page.
le terme
  Options  
             

  Filtrage type relations : +   - (ex: 4, 12, 18, 36, 444, 555, 777)
  Filtrage valeur :          min   max
  Filtrage type noeuds :   +   - (ex: 4, 6, 8, 9, 10, 12, 18, 36, 444, 555, 777)

  Présentation de sortie :   (ex: -rien-, cloud, nicecloud)
 

'machines de Turing'
(id=17423963 ; fe=machines de Turing ; type=1 ; niveau=200 ; luminosité=141 ; somme entrante=1695 creation date=2022-02-19 touchdate=2025-11-09 19:34:24.000)
≈ 4 relations sortantes

  1. machines de Turing -- r_associated #0: 49 / 1 -> machines
    n1=machines de Turing | n2=machines | rel=r_associated | relid=0 | w=49
  2. machines de Turing -- r_associated #0: 49 / 1 -> Turing
    n1=machines de Turing | n2=Turing | rel=r_associated | relid=0 | w=49
  3. machines de Turing -- r_associated #0: 25 / 0.51 -> calculabilité
    n1=machines de Turing | n2=calculabilité | rel=r_associated | relid=0 | w=25
  4. machines de Turing -- r_associated #0: 20 / 0.408 -> prix Turing
    n1=machines de Turing | n2=prix Turing | rel=r_associated | relid=0 | w=20
≈ 18 relations entrantes

  1. prix Turing --- r_associated #0: 30 --> machines de Turing
    n1=prix Turing | n2=machines de Turing | rel=r_associated | relid=0 | w=30
  2. calculabilité --- r_associated #0: 26 --> machines de Turing
    n1=calculabilité | n2=machines de Turing | rel=r_associated | relid=0 | w=26
  3. Turing --- r_associated #0: 20 --> machines de Turing
    n1=Turing | n2=machines de Turing | rel=r_associated | relid=0 | w=20
  4. machines --- r_associated #0: 20 --> machines de Turing
    n1=machines | n2=machines de Turing | rel=r_associated | relid=0 | w=20
  5. Calculabilité --- r_associated #0: 16 --> machines de Turing
    n1=Calculabilité | n2=machines de Turing | rel=r_associated | relid=0 | w=16
  6. Prix Turing --- r_associated #0: 15 --> machines de Turing
    n1=Prix Turing | n2=machines de Turing | rel=r_associated | relid=0 | w=15
  7. en:computability --- r_associated #0: 10 --> machines de Turing
    n1=en:computability | n2=machines de Turing | rel=r_associated | relid=0 | w=10
  8. algorithmique --- r_associated #0: 4 --> machines de Turing
    n1=algorithmique | n2=machines de Turing | rel=r_associated | relid=0 | w=4
  9. application --- r_associated #0: 4 --> machines de Turing
    n1=application | n2=machines de Turing | rel=r_associated | relid=0 | w=4
  10. contraction --- r_associated #0: 4 --> machines de Turing
    n1=contraction | n2=machines de Turing | rel=r_associated | relid=0 | w=4
  11. langages rationnels --- r_associated #0: 4 --> machines de Turing
    n1=langages rationnels | n2=machines de Turing | rel=r_associated | relid=0 | w=4
  12. langages reconnaissables --- r_associated #0: 4 --> machines de Turing
    n1=langages reconnaissables | n2=machines de Turing | rel=r_associated | relid=0 | w=4
  13. langages réguliers --- r_associated #0: 4 --> machines de Turing
    n1=langages réguliers | n2=machines de Turing | rel=r_associated | relid=0 | w=4
  14. Langage formel --- r_associated #0: 3 --> machines de Turing
    n1=Langage formel | n2=machines de Turing | rel=r_associated | relid=0 | w=3
  15. information quantique --- r_associated #0: 3 --> machines de Turing
    n1=information quantique | n2=machines de Turing | rel=r_associated | relid=0 | w=3
  16. informatique quantique --- r_associated #0: 3 --> machines de Turing
    n1=informatique quantique | n2=machines de Turing | rel=r_associated | relid=0 | w=3
  17. langage --- r_associated #0: 3 --> machines de Turing
    n1=langage | n2=machines de Turing | rel=r_associated | relid=0 | w=3
  18. Langage rationnel --- r_associated #0: 2 --> machines de Turing
    n1=Langage rationnel | n2=machines de Turing | rel=r_associated | relid=0 | w=2
Le service Rézo permet d'énumérer les relations existant pour un terme. Ce service est interrogeable par programme.
Projet JeuxDeMots - url: http://www.jeuxdemots.org
contact: mathieu.lafourcade@lirmm.fr