@inbook{d3dfdd3edcfe409c930bd7bc466848dc,
title = "Honest Computability and Complexity",
abstract = "We raise some issues posed by the use of representations for data structures. A nefarious representation can turn the incomputable into computable, the non-recursively-enumerable into regular, and the intractable into trivial. To overcome such problems, we propose criteria for “honesty” of implementation. In particular, we demand that inputs to functions and queries to decision procedures be specified as constructor terms.",
keywords = "Church-Turing Thesis, Computability, Computational complexity, Computational models, Computational power, Effectiveness, Encoding, Representation, Simulation, Universality",
author = "Udi Boker and Nachum Dershowitz",
note = "Publisher Copyright: \&\#x00A9; 2016, Springer International Publishing Switzerland.",
year = "2016",
doi = "10.1007/978-3-319-41842-1\_6",
language = "אנגלית",
series = "Outstanding Contributions to Logic",
publisher = "Springer International Publishing",
pages = "151--173",
booktitle = "Outstanding Contributions to Logic",
address = "שוויץ",
}