Thumbnail
Access Restriction
Subscribed

Author Winkler, Peter
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract Welcome to three new challenging mathematical puzzles. Solutions to the first two will be published next month; the third is as yet unsolved. In them all, I concentrate on algorithm termination, outlining some simple procedures and asking whether they always terminate or might possibly run forever.
Description Affiliation: Dartmouth College, Hanover, NH (Winkler, Peter)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 52
Issue Number 2
Page Count 1
Starting Page 104
Ending Page 104


Open content in new tab

   Open content in new tab
Source: ACM Digital Library