Author:
Calude Cristian,Păun Gheorghe
Reference10 articles.
1. 1. DAVIS M., MATIJASEVIČ YU. and ROBINSON J., Hilbert's Tenth Problem. Diophantine Equations : Positive Aspects of a Negative Solution, Proc. Symposia Pure Math., vol. 28, 1976, p. 223-378.4325340346.02026
2. 2. GREIBACH S. and HOPCROFT J., Scattered Context Grammars, J. Comput. Systems Sci., vol. 3, 1969, p. 233-247.2467270174.02801
3. 3. HARTMANIS J. and HOPCROFT J., Independence Results in Computer Science, ACM SIGACT News, vol. 8, 1976, p. 13-24.
4. 4. MATIJASEVIC Yu., Enumerable Sets Are Diophantine. Dokl. Akad. Nauk SSSR, vol. 191, 1970, p. 279-282.2587440212.33401
5. 5. MAURER H. A., Simple Matrix Languages with a Leftmost Restriction, Inform. Control, vol., 23, 1973, p. 128-139.3888680261.68037
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Incompleteness and the Halting Problem;Studia Logica;2021-04-15
2. The complexity of proving chaoticity and the Church–Turing thesis;Chaos: An Interdisciplinary Journal of Nonlinear Science;2010-09
3. Is complexity a source of incompleteness?;Advances in Applied Mathematics;2005-07
4. Is independence an exception?;Applied Mathematics and Computation;1994-11
5. Bibliography;Theories of Computational Complexity;1988