Affiliation:
1. School of Computer Science, Tel Aviv University, Ramat Aviv, Israel
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.
Subject
General Physics and Astronomy,General Engineering,General Mathematics
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Turing Completeness, or Why We Are So Many;SSRN Electronic Journal;2017
2. Honest Computability and Complexity;Outstanding Contributions to Logic;2016
3. The foundations of computation, physics and mentality: the Turing legacy;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2012-07-28