Abstract
We extend the notion of universality of a function, due to Turing, to arbitrary (countable) effective domains, taking care to disallow any cheating on the part of the representations used. Then, we can be certain that effective universal functions cannot simulate non-effective functions. This journal is
Original language | English |
---|---|
Pages (from-to) | 3340-3348 |
Number of pages | 9 |
Journal | Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences |
Volume | 370 |
Issue number | 1971 |
DOIs | |
State | Published - 28 Jul 2012 |
Keywords
- Computability
- Effectiveness
- Encoding
- Representation
- Universal function