How Computers Think

Overview

Computers don't have opinions, hunches, or gut feelings. Every decision a computer makes boils down to one tiny question: yes or no? On or off. True or false. One or zero. This lesson takes that abstract idea and makes it physical — children sort real objects using yes/no questions, build decision chains, and discover that even complex-sounding tasks can be broken into a sequence of simple binary choices.

Background for Parents

Binary logic is the foundation of all computing. Every pixel on a screen, every letter in a text message, every note in a song stored digitally — all of it is represented as sequences of ones and zeros. But you don't need to teach binary math to a 6-year-old. What you're teaching is the thinking pattern: break a big, fuzzy question into small, precise yes-or-no questions.

This is also the foundation of classification, decision trees, and eventually machine learning. When your child sorts buttons by asking "Is it red? Is it big? Does it have two holes?" — they are literally building a decision tree. That's how spam filters work, how medical diagnosis algorithms work, how recommendation engines work. Same logic, bigger scale.

Keep the session physical. Resist the urge to explain binary code or ones and zeros unless your child asks. The hands-on sorting is the lesson.

Lesson Flow

Opening: The Flashlight Game (5 minutes)

Hold up a flashlight. Click it on. Click it off.

"See this? The flashlight has two states: ON and OFF. There's no 'sort of on.' There's no 'a little off.' It's one or the other."

Let your child click it a few times.

"Computers are like this flashlight — but with millions of tiny switches. Each switch is either ON or OFF. And those switches, all working together, are how a computer does everything: plays music, shows videos, runs games. It all starts with ON or OFF."

"Another way to say ON and OFF is YES and NO. Or TRUE and FALSE. They all mean the same thing — two choices, nothing in between."

Core: The Sorting Challenge (20 minutes)

Dump the collection of objects on the table. Place the YES and NO bins on either side.

Round 1: One question

Write a question on an index card: "Is it red?"

"A computer can only ask yes/no questions. So let's be a computer. Here's our question: Is it red? Every object goes into YES or NO."

Let your child sort every object. When they finish, look at the bins together.

"The computer just sorted all these objects with one question. But look — the YES bin has all different things in it. A red button, a red crayon, a red LEGO. We could sort it more. How? With another yes/no question."

Round 2: Chaining questions

Take the YES bin. Write a new card: "Is it bigger than your thumb?"

"Now we ask the YES pile a second question. See how each question makes our groups smaller and more specific?"

Sort again. Then take the NO bin from Round 1 and apply a different question: "Does it have holes?"

Round 3: Child creates the questions

Mix everything back together. Now your child writes (or dictates) the yes/no questions.

"You're the computer programmer now. What question should we ask first?"

Accept whatever they propose, even if it's unusual. If they suggest something that isn't yes/no ("What color is it?"), guide them: "That's a great question, but a computer needs yes or no. Can you turn it into a yes/no question?" ("Is it blue?")

Practice: The Guessing Game (10 minutes)

One person secretly picks an object from the pile. The other person can only ask yes/no questions to figure out which one it is.

"You can't ask 'Which one is it?' You have to narrow it down with yes/no questions, just like a computer does."

Model good strategy: "Is it bigger than my hand?" eliminates many objects at once. "Is it the blue button?" only eliminates one. Talk about which questions are more powerful.

"Computers are smart about this too — they ask questions that eliminate the most possibilities first."

Closing: Everything Is Yes or No (5 minutes)

"Today you learned the biggest secret about computers: they don't understand 'maybe.' They don't understand 'sort of.' Everything a computer knows has to be turned into yes-or-no questions. And by chaining enough of those tiny questions together, you can figure out almost anything."

Ask: "Can you think of something in real life that works on yes or no?" (A light switch. A door — open or closed. A faucet — on or off.)

"The more yes/no questions you chain together, the smarter the answers get. That's how computers think."

Assessment

Adaptations

• Age 5 (younger end): Use fewer objects (8-10). Stick to one or two sorting rounds. Skip the guessing game if attention fades — come back to it another day.
• Age 7-8 (older end): Introduce the word "binary." Draw a simple decision tree on paper — a branching diagram that shows the path from question to answer. Challenge them to sort the objects into unique groups where each object is alone — how many questions does it take?
• Visual learners: Draw the decision tree as you go. Each question is a branch point. The objects at the bottom are "leaves." This is literally how computer scientists draw it.
• Kinesthetic learners: Make it a movement game. Children stand in a group. Ask yes/no questions ("Are you wearing something blue?") and they physically move to the YES or NO side of the room.

Going Deeper

• Binary counting (age 7+): Use the flashlight or fingers. One finger up = 1, down = 0. With 3 fingers, you can count from 0 to 7. How? That's binary math — and it's how computers count.
• Twenty Questions: Play the classic game regularly. It's pure binary search. Discuss strategy — "animal, vegetable, or mineral" is really two yes/no questions.
• Decision trees in real life: Next time you're deciding what to eat for dinner, draw a decision tree together. "Are we in the mood for hot food? YES. Do we want pasta? NO. Do we want rice? YES."
• Book: "How Computers Work" by Ron White (heavily illustrated — the pictures carry it for this age group).