It may absolutely be that nanoparticles of plastic are so harmful that eating off of plastic plates is a really bad idea, but my heuristic would be to not worry too much about it.
94 karma · joined January 14, 2014
It may absolutely be that nanoparticles of plastic are so harmful that eating off of plastic plates is a really bad idea, but my heuristic would be to not worry too much about it.
Like most people I lick my fingers after eating chips and don't sterilize my hands in advance, hands covered with whatever I've recently been touching (including the plastic bag that the chips came in...).
I have an air purifier at home, but there's all sorts of detritus kicked up in the air from materials around the house that my body is constantly inhaling (not to mention the exhaust and tire particulates that I get from cars driving by me or whatever is being produced in the construction site down the street).
I absolutely agree that there are plenty of things out there that are bad for you, at least in sufficient concentration. But every breath you take and every bite you eat is consuming at least some trace amounts of particles that your body doesn't need, from all sorts of sources.
It may well be that nanoparticles of plastics are particularly bad for you (in the concentrations that are normally consumed) but my heuristic is to not worry too much about things like this unless given concrete reason to.
To your point, I don't have any particular reason to think that trace quantities of plastics going through my digestive system are going to cause any harm to me. Obviously if I have specific reason for concern I'll be careful (I'm not, like, going to eat off of asbestos plates...) but otherwise I'm not going to think about it much.
It's also extensible. For example there's a very useful add-on workflow [0] that makes it really quick to open up the next Zoom meeting you have scheduled in your calendar.
A nitpick: "breadth-first heuristic search" is an algorithm developed by Zhou and Hansen and, while it's related to A* (in that it uses an admissible heuristic to prune the search space), it's not actually a variant of A*. (It's not a best-first search algorithm, since it doesn't expand nodes in increasing order of f cost.)
So if you do A* with an inconsistent heuristic, you need to revisit nodes if you explore them a second time with a cheaper cost (i.e., you can re-expand nodes in your closed list). If you do this, you will find optimal solutions even with an inconsistent heuristic.
The only requirement on your heuristic if you A* to find optimal solutions is that it be admissible.