Two Problems for Sophistication (Q2835644)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Two Problems for Sophistication	scientific article

Statements

scholarly article

0 references

Two Problems for Sophistication (English)

0 references

0 references

Steven de Rooij

0 references

Pieter Adriaans

0 references

Lecture Notes in Computer Science

0 references

publication date

30 November 2016

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-24486-0_25

0 references

Computational depth: Concept and applications

0 references

Sophistication vs logical depth

0 references

Sophistication revisited

0 references

A Safe Approximation for Kolmogorov Complexity

0 references

Algorithmic statistics

0 references

Information measures, effective complexity, and total information

0 references

0 references

On notation for ordinal numbers

0 references

An almost machine-independent theory of program-length complexity, sophistication, and induction

0 references

0 references

Sophistication as Randomness Deficiency

0 references

0 references

Kolmogorov's Structure Functions and Model Selection

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-24486-0_25

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2835644

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2835644&oldid=36290789"