Mostra el registre d'ítem simple
On infinite sequences (almost) as easy as pi
dc.contributor.author | Gavaldà Mestre, Ricard |
dc.contributor.author | Balcázar Navarro, José Luis |
dc.contributor.author | Hermo Huguet, Montserrat |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-01-27T12:42:29Z |
dc.date.available | 2016-01-27T12:42:29Z |
dc.date.issued | 1994-04 |
dc.identifier.citation | Gavaldà, R., Balcazar, J. L., Hermo, M. "On infinite sequences (almost) as easy as pi". 1994. |
dc.identifier.uri | http://hdl.handle.net/2117/82123 |
dc.description.abstract | It is known that infinite binary sequences of constant Kolmogorov complexity are exactly the recursive ones. Such a kind of statement no longer holds in the presence of resource bounds. Contrary to what intuition might suggest, there are sequences of constant, polynomial-time bounded Kolmogorov complexity that are not polynomial-time computable. This motivates the study of several resource-bounded variants in search for a characterization, similar in spirit, of the polynomial-time computable sequences. We propose some definitions, based on Kobayashi's notion of compressibility, and compare them to the standard resource-bounded Kolmogorov complexity of infinite strings. Some nontrivial coincidences and disagreements are proved and, in particular, they coincide for all usual bounds that are at least logarithmic. The resource-unbounded case is also considered. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject.other | Kolmogorov complexity |
dc.subject.other | Pi number |
dc.title | On infinite sequences (almost) as easy as pi |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1837684 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Gavaldà, R.; Balcazar, J. L.; Hermo, M. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]