home   Archives  About  Etc  Authors

Edwin Wenink

Philosophy | Artificial Intelligence | etcetera


Welcome to my personal space on the web ↯.

P ENGRAMS

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 search space exploded and the program did not terminate.

Read more


See archives for more ...

Tag roulette

latex bibtex bibliography indieweb brid.gy webmention.io indieauth microformats2 big data spark programming hackaton recommender docker programming ai ethics automation philosophy blog philosophy indieweb essay logic implication paradox autonomous vehicle ai ethics machine morality hack ransomware war terrorism cyber security philosophy portrait digital art big data google pagerank philosophy holism emergence ontology morton phenomenology security privacy identity website theme etc staticman raspberry pi github netlify comments programming python lambda dictionary cli neomutt email rice security encryption privacy pgp gpg neomutt vim workflow text editing efficiency vim workflow text editing efficiency web scraping python beautifulsoup philosophy intimacy reve theology markdown pandoc latex linux workflow writing object orientation design pattern observer programming object orientation design pattern strategy programming probability ai monte carlo philosophy ai courses tmux ssh partner programming linux complexity p np ssh tmux arch linux website diy example

Latest micros

In reply to → https://www.scienceguide.nl/2019/06/het-einde-interdisciplinaire-droom/

↬ “Als abrupte bezuinigingen elders de prijs zijn die betaald moet worden voor een versterking van de bèta- en technische disciplines, dan passen vele bèta’s daar vriendelijk voor.”

Min-hashing (Mining Massive Datasets)

📖 https://www.youtube.com/watch?v=96WOGPUgMfw

↬ Superb explanation of min-hashing as a method for efficiently approximating Jaccard similarity on bit vectors.


An IndieWeb Webring 🕸💍