On Symmetric and Choiceless Computation
Résumé
Formal models of computation such as Turing machines are usually defined as performing operations on strings of symbols.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...