4. Computer Science
  5. Information Theory

Bruno Bauwens

Computer Science – Information Theory

Scientist

Rate now
  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientist

Additivity of on-line decision complexity is violated by a linear term in the length of a binary string

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

An additivity theorem for plain Kolmogorov complexity

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Complexity of complexity and maximal plain versus prefix-free Kolmogorov complexity

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Influence tests I: ideal composite hypothesis tests, and causal semimeasures

Mathematics – Statistics Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

m-sophistication

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Bruno Bauwens does not yet have a rating. At this time, there are no reviews or comments for this scientist.

If you have personal experience with Bruno Bauwens, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bruno Bauwens will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-P-234262

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.

Canada

 Charities
 Companies
 MP Candidates
 Patents
 Employee Salary Disclosure

World

 Places of the World
 Scientific Papers

United States

 Banks
 Companies
 Counties
 Patents
 Employee Salary Disclosure