excerpt from the Wikipedia article on this topic:

“Without the self-awareness of metacognition, people cannot objectively evaluate their competence or incompetence.”

The popular version is: “Stupid people don’t realize they’re stupid.”

Here’s the link to the full article.

cf:

“If a system contains a model of itself, and can query the self-model, the system can evaluate correctness through self-observation.”

https://www.ics.uci.edu/~bdonyana/rs.pdf

also cf:

“A system which contains a model of itself can function in an anticipatory mode.”

http://citation.allacademic.com/meta/p_mla_apa_research_citation/1/1/2/8/3/p112838_index.html

keywords: psychology, delusion, illusion, superiority, inferiority

# Day: June 2, 2019

# uniBasic

I was at one time at an installation that used this computer programming language. It is from a company called Dynamic Concepts. My boss referred to them as ‘Dynamic Crybabies’, but, hey, that was 20 years ago.

Anyway, here’s the link to their website.

keywords: computers, business applications

# The Kitchn (- that’s a deliberate, cutesy, and, I suppose, trademarked, misspelling of ‘kitchen’)

They’re, like, the antithesis of the punchline of that Henny Youngman joke.

keywords: home, cooking, food, health

# bamboo dish rack

Here’s where you can buy one, on Amazon.

keywords: home, kitchen, convenience

# You were, perhaps, looking for a lid-organizer?

Here’s where you can buy one, on Amazon.

keywords: home, kitchen, convenience

# dividing up housework, without fights

Here’s the scoop.

By the way, the ‘housework’ / ‘homework’ distinction is a shibboleth for English-language learners: they often confuse the two.

keywords: diplomacy, home, roommates, cleaning, sharing, psychology, ESL, Language Arts

# Pre-order your rain straw today! – available July 2019!

We’re talking a new design of reusable straw with complete inside access!

Here’s the scoop.

keywords: sipping, sustainability, beverages, drinking straws

# a website that works directly with artisans to source their wares, especially textiles

Here’s the place, called ‘The Citizenry’.

keywords: home decor, craftsmanship, online-only, global handcrafted goods

# Perhaps like me you had no idea what an instant pot was.

Here’s the scoop.

keywords: kitchen, cooking, small space, convenience

# Mathematics Links

2n –> dihedral group of order 2n –> number of ways to arrange beads on a necklace:

http://www-cs-students.stanford.edu/~blynn//polya/

37% –> depth of search –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

acquisition –> data-acquisition –> hiring algorithm –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

algorithm –> hiring algorithm –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

arrangement –> number of ways to arrange beads on a necklace:

http://www-cs-students.stanford.edu/~blynn//polya/

choice –> optimal choice –> hiring algorithm –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

data-acquisition –> hiring algorithm –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

depth of search –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

dihedral group of order 2n –> number of ways to arrange beads on a necklace:

http://www-cs-students.stanford.edu/~blynn//polya/

formula –> Machin-like formulas:

https://en.wikipedia.org/wiki/Machin-like_formula

group –> symmetry group –> number of ways to arrange beads on a necklace:

http://www-cs-students.stanford.edu/~blynn//polya/

hiring algorithm –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

immediate rejection –> depth of search –> hiring algorithm –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

irrevocable rejection –> hiring algorithm –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

Machin-like formulas

https://en.wikipedia.org/wiki/Machin-like_formula

necklace –> number of ways to arrange beads on a necklace:

http://www-cs-students.stanford.edu/~blynn//polya/

no easy way out –> number of ways to arrange beads on a necklace:

http://www-cs-students.stanford.edu/~blynn//polya/

number of ways to arrange beads on a necklace:

http://www-cs-students.stanford.edu/~blynn//polya/

optimal choice –> hiring algorithm –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

order 2n –> dihedral group of order 2n: –> number of Ways to arrange beads on a necklace:

http://www-cs-students.stanford.edu/~blynn//polya/

pi –> Machin-like formulas:

https://en.wikipedia.org/wiki/Machin-like_formula

Polya Theory –> number of ways to arrange beads on a necklace:

http://www-cs-students.stanford.edu/~blynn//polya/

problem –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

rejection –> immediate rejection –> depth of search –> hiring algorithm –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

rejection –> irrevocable rejection –> depth of search –> hiring algorithm –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

search –> depth of search –> secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

secretary problem:

https://en.wikipedia.org/wiki/Secretary_problem

symmetry group –> number of ways to arrange beads on a necklace:

http://www-cs-students.stanford.edu/~blynn//polya/

ways –> number of ways to arrange beads on a necklace:

http://www-cs-students.stanford.edu/~blynn//polya/

(end of document)