View:

- no detail
- some detail
- full detail

## Computability and Randomness

*André Nies*

- Published in print:
- 2009
- Published Online:
- May 2009
- ISBN:
- 9780199230761
- eISBN:
- 9780191710988
- Item type:
- book

- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199230761.001.0001
- Subject:
- Mathematics, Logic / Computer Science / Mathematical Philosophy

The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic ... More

## The descriptive complexity of strings

*André Nies*

### in Computability and Randomness

- Published in print:
- 2009
- Published Online:
- May 2009
- ISBN:
- 9780199230761
- eISBN:
- 9780191710988
- Item type:
- chapter

- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199230761.003.0002
- Subject:
- Mathematics, Logic / Computer Science / Mathematical Philosophy

This chapter develops the theory of plain Kolmogorov complexity, and then of prefix-free Kolmogorov complexity. A main technical tool for later chapters is the Machine Existence (or Kraft–Chaitin) ... More

## A Computational Theory of Meaning

*Pieter Adriaans*

### in Advances in Info-Metrics: Information and Information Processing across Disciplines

- Published in print:
- 2020
- Published Online:
- December 2020
- ISBN:
- 9780190636685
- eISBN:
- 9780190636722
- Item type:
- chapter

- Publisher:
- Oxford University Press
- DOI:
- 10.1093/oso/9780190636685.003.0002
- Subject:
- Economics and Finance, Microeconomics

A computational theory of meaning tries to understand the phenomenon of meaning in terms of computation. Here we give an analysis in the context of Kolmogorov complexity. This theory measures the ... More

## When are graphical causal models not good models?

*Jan Lemeire, Kris Steenhaut, and Abdellah Touhafi*

### in Causality in the Sciences

- Published in print:
- 2011
- Published Online:
- September 2011
- ISBN:
- 9780199574131
- eISBN:
- 9780191728921
- Item type:
- chapter

- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199574131.003.0027
- Subject:
- Mathematics, Logic / Computer Science / Mathematical Philosophy

The principle of Kolmogorov minimal sufficient statistic (KMSS) states that the meaningful information of data is given by the regularities in the data. The KMSS is the minimal model that describes ... More

## The importance of exhaustive description in measuring linguistic complexity: the case of English try and pseudocoordination

*Daniel Ross*

### in Measuring Grammatical Complexity

- Published in print:
- 2014
- Published Online:
- December 2014
- ISBN:
- 9780199685301
- eISBN:
- 9780191765476
- Item type:
- chapter

- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199685301.003.0010
- Subject:
- Linguistics, Syntax and Morphology, Psycholinguistics / Neurolinguistics / Cognitive Linguistics

Attempts to measure grammatical complexity are often based on data from a subset of properties in a language as an approximation. Despite this, such a subset of core grammatical phenomena is not ... More

## Discovering Patterns in DNA Sequences by the Algorithmic Significance Method

*Aleksandar Milosavljević*

### in Title Pages

- Published in print:
- 1999
- Published Online:
- November 2020
- ISBN:
- 9780195119404
- eISBN:
- 9780197561256
- Item type:
- chapter

- Publisher:
- Oxford University Press
- DOI:
- 10.1093/oso/9780195119404.003.0006
- Subject:
- Computer Science, Systems Analysis and Design

The parsimony method for reconstruction of evolutionary trees (Sober, 1988) and the minimal edit distance method for DNA sequence alignments (e.g., ... More

View:

- no detail
- some detail
- full detail