-
25
pages
-
English
-
Documents
Description
Introduction and definitions Computability and undecidability Abstract geometrical computation: Turing-computing ability and undecidability Jerome Durand-Lose Laboratoire d'Informatique Fondamentale d'Orleans, Universite d'Orleans, Orleans, FRANCE CiE 2005: New Computational Paradigms Amsterdam, June 8th, 2005 Jerome Durand-Lose Abst. geom. comp.: computability and undecidability
- introduction signal
- laboratoire d'informatique fondamentale d'orleans
- qz bi-infinite
- turing-computing ability
- space time diagrams
- counter automata
-
Publié par
-
Langue
English
-
Poids de l'ouvrage
2 Mo