Complexity 101 and the P-NP question

Anyone working with computer algorithms sometimes has to reflect on the question what the complexity of that algorithm is. Last week I tortured my poor laptop by letting it crunch away the whole night on a planning problem using A* with the $h_{max}$ heuristic, only to find that upon waking up 1) the cpu heat was quite critical and 2) that the …

Read more


See archives for more ...

Latest comments

Q commented on /digest-2021-04 on Apr 30, 2021
Edwin replied to /42-Vim_Notetaking on Apr 22, 2021
Ritchie commented on /42-Vim_Notetaking on Apr 22, 2021
Edwin replied to /42-Vim_Notetaking on Apr 22, 2021
captain shambles commented on /42-Vim_Notetaking on Apr 22, 2021

Tags

about agre ai annotations arch automation autonomous vehicle bayes beautifulsoup bibliography bibtex big data blog book review boolean brid.gy cli coetzee comments community complexity courses ctags cyber death deepfake democracy derrida design pattern dictionary digest digital art digitalization diy docker efficiency email emergence encryption epub etc ethics example friendship function creep gaussian github google gpg hack hackaton healthcare heidegger hermeneutics holism hugo identity implication indieauth indieweb induction inference intimacy ir kobo lambda latex law linux literature logic machine learning machine morality map markdown math michel de montaigne microformats2 mle monte carlo morton music neomutt netlify nginx nlp note-taking now numpy object orientation observer ontology pagerank pandas pandoc paradox partner perceptron pgp phenomenology philosophy portrait privacy probability programming python ransomware raspberry pi recommender regex reve rice ricoeur russell security simulacrum sklearn south-africa spark ssh staticman strategy surveillance technocracy templating terrorism text editing theme theology tilde tmux vim war web scraping webmention.io website workflow writing zettelkasten
An IndieWeb Webring 🕸💍