Natural computation for natural language

摘要: Computation not only takes place in provoked contexts of scientific experimentation, but natural circumstances too. We are going to approach computation contexts. How the nature computes? Turing machines and Chomsky grammars rewriting systems, same is true for Post, Thue, Markov, Lindenmayer other classes axiomatic systems. If, among whole set objects, we focus language description, must say that major trends contemporary linguistics look at syntax as a process. Is unavoidable this case, does our mind work by rewriting, compute way? shall attempt defend answer could be negative. The arguments will come from computability theory well linguistics. First we'll formally explain former ones, then informally latter ones. With regard arguments, see that, using operation adjoining, large generative capacity obtained. This case with contextual grammars. It has recently been proved each recursively enumerable quotient regular generated grammar particular form. Thus, adjoining (paste) (cut) lead computational universality. Recursively languages can also characterized an insertion grammar. result obtained if take splicing operation, formal model DNA recombination. again cut-and-paste operation. On basis proof result, several further characterizations have Computability theory, then, reconstructed without (and non-terminal symbols) any loss power. Our first aim show some aspects such reconstruction. Later, try obtain consequences future development language.