Archive of stories published by Biffures

Homepage

Open in app

All

Cédric Bellet in Biffures

Aug 3, 2016

Part 2: The beauty of bitwise AND (∧ or &)

Exploring and visualizing the many facets of the bitwise…

6 responses

Cédric Bellet in Biffures

Jan 3, 2018

Part 5: Hashing with SHA-256

An overview of SHA-256, a standard secure hash function, as described in…

4 responses

Cédric Bellet in Biffures

Mar 18, 2018

RL Course by David Silver (Lectures 1 to 4)

A summary of 15 hours into reinforcement learning

I continue my quest to learn something about reinforcement learning in 60 days (this is day 20), with a 15 hour investment in Deepmind’s David…

1 response

Cédric Bellet in Biffures

Sep 8, 2016

Part 4: Bitwise Patterns

A bitwise ops cheatsheet (¬, <<, >>, ROTR/L, +, ∧, ∨, ⊕)

1 response

Cédric Bellet in Biffures

Oct 17, 2019

Fermat’s little theorem

An “etymological” and visual exploration of Fermat’s little theorem, one of…

2 responses

Cédric Bellet in Biffures

Jul 28, 2016

Part 1: Bits 101

A contract on naming conventions before diving into bitwise operations and algorithms

Cédric Bellet in Biffures

Apr 12, 2018

RL Course by David Silver (Lectures 5 to 7)

This is day 45 of my 60-day reinforcement learning challenge, and we continue the series of lectures by Deepmind’s David Silver.

Cédric Bellet in Biffures

Aug 9, 2016

Part 3: Bitwise OR, AND’s sibling

A review of the bitwise OR function (∨ or |) and of its relation to…

Cédric Bellet in Biffures

Feb 26, 2018

All the single neurons

Where we learn that it takes one neuron to solve multilinear regressions and logistic regressions, which I thought were pretty advanced back in university

Cédric Bellet in Biffures

Mar 6, 2018

Network sparsity and rectifiers

Where we learn why, despite being amazing on their own, linear and…

1 response

These were the top 10 stories published by Biffures; you can also dive into yearly archives: 2016, 2018, 2019, and 2021.

About

Biffures

“biffures” is French for crossing-outs; here you will find semi-random explorations and incomplete ideas that generally involve math and computer programming

More information