Sadness, Upload forgotten Good reason for disappointment Beautiful date night Lucas

Sadness, Upload forgotten Good reason for disappointment Beautiful date night Lucas

Had a good night. Will write more sooooon. Best, Lucas

Had a good night. Will write more sooooon. Best, Lucas

Hi, Not writing much. Not feeling great. Sleep early. Night, Lucas

Hi, Not writing much. Not feeling great. Sleep early. Night, Lucas

Hi, I wrote for about an hour summarizing learnings about RSA. I am aiming to finish up tomorrow. This read and then write situation is definitely aiding my learning. That feels good. Night, Lucas

Hi, I wrote for about an hour summarizing learnings about RSA. I am aiming to finish up tomorrow. This read and then write situation is definitely aiding my learning. That feels good. Night, Lucas

Hi, I tried doing a weekly plan again. I did it in college when I had to crank through my Masters. I want to see how it feels to get back into that habit again. A reflection will be posted eventually. Night, Lucas

Hi, I tried doing a weekly plan again. I did it in college when I had to crank through my Masters. I want to see how it feels to get back into that habit again. A reflection will be posted eventually. Night, Lucas

Hi, Had a nice haiku Because I was going to surf Cancelled by a bug Lucas

Hi, Had a nice haiku Because I was going to surf Cancelled by a bug Lucas

Hi again, I read and wrote most of a chapter. That’s good for today. Lucas

Hi again, I read and wrote most of a chapter. That’s good for today. Lucas

Next chapter of the book is about hard problems. This section will be a briefer writing process bc I’ve spent so much time dealing with this theory before.How do we measure how hard algorithms are to run?Before we run an algorithm we want a sense of how long the algorithm will take to run. The longer the algorithm takes to run the harder it is to compute the result (leading us to the idea of computational hardness). To measure how long an algorithm will take we figure out how many simple step...

Next chapter of the book is about hard problems. This section will be a briefer writing process bc I’ve spent so much time dealing with this theory before.How do we measure how hard algorithms are to run?Before we run an algorithm we want a sense of how long the algorithm will take to run. The longer the algorithm takes to run the harder it is to compute the result (leading us to the idea of computational hardness). To measure how long an algorithm will take we figure out how many simple step...

Oil mixed together Instructor showing colors Painting the the light Night, Lucas

Oil mixed together Instructor showing colors Painting the the light Night, Lucas

Hi, Spent 45 minutes Digesting half the chapter Will finish and then write Night, Lucas

Hi, Spent 45 minutes Digesting half the chapter Will finish and then write Night, Lucas

Hi, Knowledge to digest In place of word creation Hope of focusing Bye, Lucas

Hi, Knowledge to digest In place of word creation Hope of focusing Bye, Lucas

This is a quick post Had a good night, Good indeed No write time tonight

This is a quick post Had a good night, Good indeed No write time tonight