Computing and Information Technology Interactive Digital Educational Library


Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item:

Title: halting problem
Issue Date: 28-Apr-2006
Publisher: PlanetMath
Abstract: The ... halting problem is to determine, given a particular input to a particular computer program, whether the program will terminate after a finite number of steps. The consequences of a solution to the halting problem are far-reaching. Consider some predicate ... regarding natural numbers; suppose we conjecture that ... holds for all ... . (Goldbach's conjecture, for example, takes this form.) We can write a program that will count up through the natural numbers and terminate upon finding some
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat

All items in DSpace are protected by copyright, with all rights reserved.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback