Deviant Encodings
| dc.contributor.author | Copeland, B. Jack | |
| dc.contributor.author | Proudfoot, D | |
| dc.date.accessioned | 2024-09-13T01:38:44Z | |
| dc.date.available | 2024-09-13T01:38:44Z | |
| dc.date.issued | 2003 | |
| dc.description.abstract | What is computation? We describe a number of related techniques that enable Turing machines to solve the halting problem. In each case, the machine’s (supposedly impossible) behaviour is made possible by a feature of the encoding scheme employed either to represent the input or to represent the output. Some means of excluding these deviant encodings is required when using the Turing-machine concept to define the traditional set of computable functions. The exercise of quarantining deviant encodings casts fresh light on Turing's historic definition of computability. | |
| dc.identifier.citation | Copeland BJ, Proudfoot D (2003). Deviant Encodings and the Turing Definition of Computability. La Trobe University, Melbourne, Australia, 2003. | |
| dc.identifier.uri | https://hdl.handle.net/10092/107565 | |
| dc.rights | All rights reserved unless otherwise stated | |
| dc.rights.uri | http://hdl.handle.net/10092/17651 | |
| dc.subject.anzsrc | 46 - Information and computing sciences::4613 - Theory of computation | |
| dc.title | Deviant Encodings | en |
| dc.title.alternative | Deviant Encodings and the Turing Definition of Computability | en |
| dc.type | Oral Presentation | |
| uc.college | Faculty of Arts | |
| uc.department | Humanities |