Computability Export

@misc{citeulike:4537933, abstract = {this article, we are interested in characterizing as precisely as possible, those problems that can and cannot be solved by a computer. We are not concerned here with the efficiency or practicality of the solutions; we are merely interested in any computer solution to the problem, even one that is unrealistically slow or that operates on an imaginary computer, even one exploiting unbounded time and memory space. The equally important problem of characterizing the problems that can and cannot be computed efficiently is addressed elsewhere in this encyclopedia. See Computational Complexity Theory.}, author = {Sheila, Toniann P. and Mcilraith, Sheila and Brecht, Timothy}, citeulike-article-id = {4537933}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.1170}, keywords = {citeulike-doc2}, posted-at = {2009-05-18 12:29:16}, priority = {2}, title = {Computability}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.1170} }

TY - ELEC ID - citeulike:4537933 L3 - citeulike-article-id:4537933 N2 - this article, we are interested in characterizing as precisely as possible, those problems that can and cannot be solved by a computer. We are not concerned here with the efficiency or practicality of the solutions; we are merely interested in any computer solution to the problem, even one that is unrealistically slow or that operates on an imaginary computer, even one exploiting unbounded time and memory space. The equally important problem of characterizing the problems that can and cannot be computed efficiently is addressed elsewhere in this encyclopedia. See Computational Complexity Theory. TI - Computability KW - citeulike-doc2 AU - Sheila, Toniann AU - Mcilraith, Sheila AU - Brecht, Timothy UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.1170 ER -