%0 Journal Article %1 citeulike:14257694 %A Copeland, B. Jack %A Sylvan, Richard %D 1999 %I Routledge %J Australasian Journal of Philosophy %K 03b25-decidability-of-theories-and-sets-of-sequences, 03d10-turing-machines-and-related-notions, 03d75-abstract-and-axiomatic-computability-and-recursion-theory, 68q05-models-of-computation %N 1 %P 46--66 %R 10.1080/00048409912348801 %T Beyond the Universal Turing Machine %U http://dx.doi.org/10.1080/00048409912348801 %V 77

@article{citeulike:14257694, added-at = {2017-06-29T07:13:07.000+0200}, author = {Copeland, B. Jack and Sylvan, Richard}, biburl = {https://www.bibsonomy.org/bibtex/2856de982a4665ddb14088eb3f2ad0efb/gdmcbain}, citeulike-article-id = {14257694}, citeulike-attachment-1 = {copeland_99_beyond.pdf; /pdf/user/gdmcbain/article/14257694/1098415/copeland_99_beyond.pdf; d0e3486aea0e970b32b207f8240d94a2a4c1f091}, citeulike-linkout-0 = {http://dx.doi.org/10.1080/00048409912348801}, citeulike-linkout-1 = {http://www.tandfonline.com/doi/abs/10.1080/00048409912348801}, day = 1, doi = {10.1080/00048409912348801}, file = {copeland_99_beyond.pdf}, interhash = {6cc8b45c8f6bfa9d3a287990231e628a}, intrahash = {856de982a4665ddb14088eb3f2ad0efb}, journal = {Australasian Journal of Philosophy}, keywords = {03b25-decidability-of-theories-and-sets-of-sequences, 03d10-turing-machines-and-related-notions, 03d75-abstract-and-axiomatic-computability-and-recursion-theory, 68q05-models-of-computation}, month = mar, number = 1, pages = {46--66}, posted-at = {2017-01-19 00:35:29}, priority = {2}, publisher = {Routledge}, timestamp = {2017-06-29T07:13:07.000+0200}, title = {Beyond the Universal {T}uring Machine}, url = {http://dx.doi.org/10.1080/00048409912348801}, volume = 77, year = 1999 }