Honest universality

Nachum Dershowitz; Evgenia Falkovich

doi:10.1098/rsta.2012.0220

Honest universality

Nachum Dershowitz^*
, Evgenia Falkovich

^*Corresponding author for this work

School of Computer Science and AI

Tsinghua University
Tel Aviv University

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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	https://doi.org/10.1098/rsta.2012.0220
State	Published - 28 Jul 2012

Keywords

Computability
Effectiveness
Encoding
Representation
Universal function

Access to Document

10.1098/rsta.2012.0220

Cite this

@article{6a258e31bb62418bb29862d9eaace705,

title = "Honest universality",

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",

keywords = "Computability, Effectiveness, Encoding, Representation, Universal function",

author = "Nachum Dershowitz and Evgenia Falkovich",

year = "2012",

month = jul,

day = "28",

doi = "10.1098/rsta.2012.0220",

language = "אנגלית",

volume = "370",

pages = "3340--3348",

journal = "Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences",

issn = "1364-503X",

publisher = "Royal Society Publishing",

number = "1971",

}

TY - JOUR

T1 - Honest universality

AU - Dershowitz, Nachum

AU - Falkovich, Evgenia

PY - 2012/7/28

Y1 - 2012/7/28

N2 - 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

AB - 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

KW - Computability

KW - Effectiveness

KW - Encoding

KW - Representation

KW - Universal function

UR - https://www.scopus.com/pages/publications/84862881072

U2 - 10.1098/rsta.2012.0220

DO - 10.1098/rsta.2012.0220

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

C2 - 22711862

AN - SCOPUS:84862881072

SN - 1364-503X

VL - 370

SP - 3340

EP - 3348

JO - Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences

JF - Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences

IS - 1971

ER -

Honest universality

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this