๐Ÿ“• subnode [[@jakeisnt/2020 10 04]] in ๐Ÿ“š node [[2020-10-04]]
๐Ÿ“• text contributed by @jakeisnt ๐Ÿ”—

20:27 favorite manga

blame! one piece akira (check it out!) bleach beginning and art (but not story......)

20:55 hillel newsletter


  • semidefinite programming

satsolving notes

famous np complete problem: must find satisfying formula for the boolean varaibles and statement for sanity we format the statement to assume conjunctive normal form find assignment that satisfies the equation

all np-complete problems can be converted to 3-sat problem sat solvers can quickly solve problems with lots of variables! this is mostly used for dependency management. but how do you prove a transition from your problem into sat?

  • aside: cleverness is communicated in a domain with experience, but can be transferred

  • posits that cleverness is only necessary with a lack of communication

  • smt community -> off of sat -> puts effort into affordances

Receiving pushes... (requires JavaScript)
Loading context... (requires JavaScript)
๐Ÿ“– stoas (collaborative spaces) for [[@jakeisnt/2020 10 04]]