Short lists with short programs in short time

Given a machine \(U\), a \(c\)-short program for \(x\) is a string \(p\) such that \(U(p)=x\) and the length of \(p\) is bounded by \(c\) + (the length of a shortest program for \(x\)). We show that for any standard Turing machine, it is possible to compute in polynomial time on input \(x\) a list o...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2017-03
Hauptverfasser:	Bauwens, Bruno, Makhlin, Anton, Vereshchagin, Nikolay, Zimand, Marius
Format:	Artikel
Sprache:	eng
Schlagworte:	Polynomials Turing machines
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!