Searching for authors named "Guillaume Bonfante" – sorted by Relevance.
5 documents found, showing 1 through 5.
-
unknown title
- …Abstract We present here a stochastic point of vue on Lambek Categorial Grammars whichhave shown their utility in Natural Language Processing. The key point comes from the fact that the parsing in the Lambek Calculus is based on an essentiallynon-deterministic algorithm. We claim that a stochasting …
- Add To MetaCart
-
Constructing Orders By Means of Inductive Definitions
- …We present a class of algebraic theories that are enriched over a novel Symmetrical Monoidal Closed structure on the category of graphs, whose free models are posets that are equipped with an induction principle, which is easily formalized in type theory. We give examples. The development of comput…
- Add To MetaCart
-
Recursion schemata for NC k
- …We give a recursion-theoretic characterization of the complexity classes NC k for k ≥ 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed. It is based on three recursion schemes, one corresponds to time (tim…
- Add To MetaCart
-
A characterization of alternating log time by first order functional programs
- …Abstract. We a give an intrinsic characterization of the class of functions which are computable in NC 1 that is by a uniform, logarithmic depth and polynomial size family circuit. Recall that the class of functions in ALogTime, that is in logarithmic time on an Alternating Turing Machine, is NC 1. …
- Cited by 3 (2 self) – Add To MetaCart
-
A classification of viruses through recursion theorems
- …We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene’s second recursion theorem. We show that we can classify viruses as solutions of fixed point equations which are obtained from different ver…
- Cited by 3 (0 self) – Add To MetaCart
Showing 1 through 5.
