GEOMETRIDAE

Hi, I'm Astrid Motilla Mathematician and Artist.

[Dwayne @CtrlAltDwayne]

Philomena: Some people have been writing PHP for over 20 years. Is that because it's particularly difficult to finish?

Expert: No, software is constantly evolving.

Philomena: So they've been writing the same website for 20 years?

Expert: No, different projects.

Philomena: Have they tried finishing one before starting another?

Expert: That's not how software development works.

Philomena: My mate Paul spent 20 years building a shed. Turned out he was just an alcoholic.

Expert: Right.

Philomena: Is PHP like that?

[Abakcus @abakcus]

How to Learn Mathematics: A Self-Study Roadmap

https://t.co/CfI0LDuu7Z

[GEOMETRIDAE @GEOMETRYDAE]

@Colonthreee

[Junior Rojas @junior_rojas_d]

unexpectedly aggressive behaviors driven by competitive pressure in the arena

[Tel @telmudic]

statically linked, self-contained software applications rn

[Faune 🎨 @thefaune1]

😬🕸️

[GEOMETRIDAE @GEOMETRYDAE]

@Colonthreee it's all about enjoying programming. I think if we motivate people to do that, to develop computational thinking they will have a different relationship with AI. Instead of everyone being so reactive all the time

[GEOMETRIDAE @GEOMETRYDAE]

@Colonthreee I feel like it's okay to make people aware of the problem so it's not bad to be tweeting about this. To be honest sometimes I get tired of the constant guilt tripping from other devs, at work most of us use it, with prudence but it's a bit hard sometimes to not feel bad about it

[andrew blinn - bedframeless era @disconcision]

drag out a helper, hoisting dependencies along with it

[Alex Smith @ninja_maths]

If you feel the same, check out our mathematical foundations sequence.

Especially designed to propel adult students to the upper echelons of math as efficiently as possible.

https://t.co/dh3SYh8xCc

[matharium @matharium]

The state graph of the Tower of Hanoi has a vertex for each placement of n disks on three pegs, 3ⁿ in all, and an edge for each legal move.

The largest disk moves only when every smaller disk sits on the third peg, so the graph is three copies of the graph for n − 1 joined by three single edges: the Sierpiński recursion. The optimal solution runs straight along one side in 2ⁿ − 1 moves.

For n = 7 that is 2187 states, 3279 edges and 127 moves.

[vittorio @IterIntellectus]

this will just keep happening