Classes of Recursively Enumerable Sets and Their Decision Problems Export

@article{rice53, author = {Rice, H. G.}, citeulike-article-id = {1681987}, citeulike-linkout-0 = {http://www.jstor.org/stable/1990888}, comment = {Compare with the main theorem of the following paper, which does for recursive functions (or recursive sets) what Rice's theorem does for partial recursive functions (or recursively enumerable sets): Computability of simple games: A characterization and application to the core by: Masahiro Kumabe, HR Mihara Journal of Mathematical Economics, Vol. 44, No. 3-4. (February 2008), pp. 348-366. http://jp.citeulike.org/user/reiju/article/2818166 }, journal = {Transactions of the American Mathematical Society}, keywords = {algorithms, computability, computer\_science, recursion-theory, rice-theorem, turing-computability}, number = {2}, pages = {358--366}, posted-at = {2008-08-28 23:07:18}, priority = {2}, title = {Classes of Recursively Enumerable Sets and Their Decision Problems}, url = {http://www.jstor.org/stable/1990888}, volume = {74}, year = {1953} }

TY - JOUR ID - rice53 L3 - citeulike-article-id:1681987 IS - 2 JF - Transactions of the American Mathematical Society EP - 366 TI - Classes of Recursively Enumerable Sets and Their Decision Problems VL - 74 SP - 358 KW - algorithms KW - computability KW - computer_science KW - recursion-theory KW - rice-theorem KW - turing-computability N1 - Compare with the main theorem of the following paper, which does for recursive functions (or recursive sets) what Rice's theorem does for partial recursive functions (or recursively enumerable sets): Computability of simple games: A characterization and application to the core by: Masahiro Kumabe, HR Mihara Journal of Mathematical Economics, Vol. 44, No. 3-4. (February 2008), pp. 348-366. http://jp.citeulike.org/user/reiju/article/2818166 AU - Rice, HG PY - 1953/// UR - http://www.jstor.org/stable/1990888 ER -