Browse Groups

• ## [My Computational Complexity Web Log] NP-Completeness for a 9-Year Old

(4)
• NextPrevious
• My nine-year old daughter had a homework problem with the following diagram. She had no problem solving questions like: Beginning and ending at the entrance,
Message 1 of 4 , Oct 7, 2004
View Source
My nine-year old daughter had a homework problem with the following diagram.

She had no problem solving questions like: Beginning and ending at the entrance, describe the shortest route you can take that will allow you to see 4 different kinds of animals.

"You're doing computer science," I said.

"I don't see any computers," she responded.

"Computer science is problem solving like finding the shortest path."

"Then computer science is pretty easy."

"OK, is there a way to visit every animal exactly once?"

She found this question much more challenging.

--
Posted by Lance to My Computational Complexity Web Log at 10/7/2004 07:18:55 PM

• My nine-year old daughter had a homework problem with the following diagram. She had no problem solving questions like: Beginning and ending at the entrance,
Message 1 of 4 , Oct 7, 2004
View Source
My nine-year old daughter had a homework problem with the following diagram.

She had no problem solving questions like: Beginning and ending at the entrance, describe the shortest route you can take that will allow you to see 4 different kinds of animals.

"You're doing computer science," I said.

"I don't see any computers," she responded.

"Computer science is problem solving like finding the shortest path."

"Then computer science is pretty easy."

"OK, is there a way to visit every animal exactly once?"

She found this question much more challenging.

--
Posted by Lance to My Computational Complexity Web Log at 10/7/2004 07:18:42 PM

• My nine-year old daughter had a homework problem with the following diagram. She had no problem solving questions like: Beginning and ending at the entrance,
Message 1 of 4 , Oct 7, 2004
View Source
My nine-year old daughter had a homework problem with the following diagram.

She had no problem solving questions like: Beginning and ending at the entrance, describe the shortest route you can take that will allow you to see 4 different kinds of animals.

"You're doing computer science," I said.

"I don't see any computers," she responded.

"Computer science is problem solving like finding the shortest path."

"Then computer science is pretty easy."

"OK, is there a way to visit every animal exactly once?"

She found this question much more challenging.

--
Posted by Lance to My Computational Complexity Web Log at 10/7/2004 07:18:49 PM

• My nine-year old daughter had a homework problem with the following diagram. She had no problem solving questions like: Beginning and ending at the entrance,
Message 1 of 4 , Oct 7, 2004
View Source
My nine-year old daughter had a homework problem with the following diagram.

She had no problem solving questions like: Beginning and ending at the entrance, describe the shortest route you can take that will allow you to see 4 different kinds of animals.

"You're doing computer science," I said.

"I don't see any computers," she responded.

"Computer science is problem solving like finding the shortest path."

"Then computer science is pretty easy."

"OK, is there a way to visit every animal exactly once?"

She found this question much more challenging.

--
Posted by Lance to My Computational Complexity Web Log at 10/7/2004 07:18:47 PM

Your message has been successfully submitted and would be delivered to recipients shortly.
• Changes have not been saved
Press OK to abandon changes or Cancel to continue editing
• Your browser is not supported
Kindly note that Groups does not support 7.0 or earlier versions of Internet Explorer. We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox. If you are using IE 9 or later, make sure you turn off Compatibility View.