Honest Computability and Complexity

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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.

Original languageEnglish
Title of host publicationOutstanding Contributions to Logic
PublisherSpringer
Pages151-173
Number of pages23
DOIs
StatePublished - 2016

Publication series

NameOutstanding Contributions to Logic
Volume10
ISSN (Print)2211-2758
ISSN (Electronic)2211-2766

Keywords

  • Church-Turing Thesis
  • Computability
  • Computational complexity
  • Computational models
  • Computational power
  • Effectiveness
  • Encoding
  • Representation
  • Simulation
  • Universality

Fingerprint

Dive into the research topics of 'Honest Computability and Complexity'. Together they form a unique fingerprint.

Cite this