Author： Margenstern M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.231, Iss.2, 2000-01, pp. : 217-251
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Undecidability in the Imitation Game
By Sato Yuzuru Ikegami Takashi
Minds and Machines, Vol. 14, Iss. 2, 2004-05 ,pp. :
Access to resources
Recommend
A Survey of Transfer Between Connectionist Networks
By Pratt Lorien Jennings Barbara
Connection Science, Vol. 8, Iss. 2, 1996-06 ,pp. :
On the decidability of process equivalences for the -calculus
By Dam M.
Theoretical Computer Science, Vol. 183, Iss. 2, 1997-09 ,pp. :
Decidability problems in grammar systems
By Mihalache V.
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :