NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 3 results Save | Export
Peer reviewed Peer reviewed
Kolata, Gina – Science, 1985
To determine how hard it is for computers to solve problems, researchers have classified groups of problems (polynomial hierarchy) according to how much time they seem to require for their solutions. A difficult and complex proof is offered which shows that a combinatorial approach (using Boolean circuits) may resolve the problem. (JN)
Descriptors: Classification, Computer Science, Difficulty Level, Mathematical Logic
Peer reviewed Peer reviewed
Galda, Klaus – Two-Year College Mathematics Journal, 1981
The history of formal mathematical proofs is sketched out, starting with the Greeks. Included in this document is a chronological guide to mathematics and the world, highlighting major events in the world and important mathematicians in corresponding times. (MP)
Descriptors: Mathematical Concepts, Mathematical Logic, Mathematicians, Mathematics
Peer reviewed Peer reviewed
Marx, George – Impact of Science on Society, 1982
Presents an interview with Erno Rubik, creator of "Rubik's Cube." Included are comments about the creation of the cube and the role of the cube in educating people, especially in problem-solving activities. (JN)
Descriptors: Educational Games, Elementary Secondary Education, Games, Higher Education