|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 15 van 16 gevonden artikelen
| Titel: |
Simulation Complexity |
| Auteur: |
Hay, Nicholas J. |
| Verschenen in: |
Fundamenta informaticae |
| Paginering: | Jaargang 83 (2008) nr. 1-2 pagina's 117-140 |
| Jaar: |
2008-05-27 |
| Inhoud: |
In Algorithmic Information Theory, the algorithmic complexity of a sequence is the length of the shortest program which generates it. Is there a measure of the complexity of a computer? We define the simulation complexity of a computer to be the least cost of simulating that computer on a fixed universal computer. We generalise this to processes, computers which can have potentially infinite output (e.g. monotone Turingmachines). Thismeasure has monotone complexity as a special case. Simulation complexity has applications to sequence prediction, leading to a clarification of a central prediction error inequality and a stronger form of dominance. Enumerable semimeasures are functions which represent sequence predictors. These semimeasures can be in turn represented by processes. A universal process generates a universal semimeasure: one that outperforms any other predictor but for a cost depending on how complex that predictor is. This extra cost is exactly the simulation complexity of the predictor. |
| Uitgever: |
IOS Press |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 15 van 16 gevonden artikelen
| << vorige | volgende >> |