ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Puzzled
Will my algorithm terminate?
Full text Digital EditionDigital Edition ,  HtmlHtml (6 KB),  PdfPdf (582 KB)
Source
Communications of the ACM archive
Volume 52 ,  Issue 2  (February 2009) table of contents
Inspiring Women in Computing
COLUMN: Last byte table of contents
Pages 104-104  
Year of Publication: 2009
ISSN:0001-0782
Author
Peter Winkler  Dartmouth College, Hanover, NH
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 404,   Citation Count: 0
Additional Information:

abstract   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1461928.1461952
What is a DOI?

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.


INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.0 GENERAL

Collaborative Colleagues:
Peter Winkler: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player