Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

CIE
2006
Springer

favoriteEmaildiscussreport

97views Applied Computing» more CIE 2006»

Prefix-Like Complexities and Computability in the Limit

13 years 9 months ago

Prefix-Like Complexities and Computability in the Limit

Download www.cs.swan.ac.uk

Alexey V. Chernov, Jürgen Schmidhuber

Real-time Traffic

Applied Computing | CIE 2006 |

claim paper

Related Content

» Fundamental RateReliabilityComplexity Limits in Outage Limited MIMO Communications

» Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited In...

» On the Limits of BottomUp Computer Simulation Towards a Nonlinear Modeling Culture

» Brain Complexity Analysis Models and Limits of Understanding

» Teaching computer organizationarchitecture with limited resources using simulators

» Computing complete answers to queries in the presence of limited access patterns

» Complexity Limitations on Quantum Computation

» Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simu...

» Limiting Negations in Formulas

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	CIE
Authors	Alexey V. Chernov, Jürgen Schmidhuber

Comments (0)