CABedardPhysics Profile Banner
Charles Alexandre Bédard Profile
Charles Alexandre Bédard

@CABedardPhysics

Followers
310
Following
280
Media
28
Statuses
216

Physicist, father, fallibilist & optimist.

Joined October 2020
Don't wanna be here? Send us removal request.
@CABedardPhysics
Charles Alexandre Bédard
22 hours
RT @Sam_kuyp: I’ve just published a new blog post: In Defence of Discussion.
0
10
0
@CABedardPhysics
Charles Alexandre Bédard
27 days
RT @maria__violaris: The local account of quantum theory, explained with @NicetuTV — now out on X! If you want to understand how it's possi….
0
20
0
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 22 – Universal lower semi-computable semi-measures, chain rule for prefix complexity.
0
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 21 – The Coding Theorem.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 20 – Chaitin’s philosophy of maths, a discussion on mathematics and knowledge.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 19 – Omega is incompressible, mathematical truths in Omega, Chaitin’s Incompleteness Theorem.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 18 – Omega is a compressed oracle for the Halting Problem.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 17 – The uncomputability of algorithmic complexity, the halting probability Omega.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 16 – Solving the problems of plain complexity (Audio missing).
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 15 – Prefix complexity, self-delimiting Turing machines.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 14 – Chain rule for plain complexity, incompressibility, Solomonoff’s probability measure.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 13 – Upper bound of algorithmic complexity, complexity of pairs, conditional complexity.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 12 – Plain versus prefix complexity, additive optimality, Invariance Theorem.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 11 – Rice’s Theorem, algorithmic complexity, communicating π, what are random strings?.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 10 – The Halting Problem, incompleteness from uncomputability.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 9 – Decidable sets, recursively enumerable sets, recognizable sets.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 8 – The Church–Turing Thesis, computational universality, the Church–Turing–@DavidDeutschOxf Principle.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 7 – Partial recursive functions, the universal Turing machine .
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 6 – Computability theory, Turing machines, mathematizing the mathematician.
1
0
1
@CABedardPhysics
Charles Alexandre Bédard
1 month
AIT 5 – Conditional entropy, mutual information, chain rule, data processing inequality.
1
0
1