In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...

The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines ...

UNIGE scientists developed a neuro-computer model which helps explain how the brain identifies syllables in natural speech. The model uses the equivalent of neuronal oscillations produced by brain ...

The aim of this paper is to introduce to the linguistic community some preliminary findings in the area of text planning which I hope will serve to lay the foundations of a computational theory of ...