The halting problem

Publisher Website
Google Scholar
Abstract
Fproblems . The instructions must not require ingenuity or intelligence t o execute and their execution must eventually halt or terminate with a solutio n to the problem 1. A familiar procedure that either is or may be turned into a n algorithm is the truth-table test for the equivalence of sentences in a language for truth-functional sentential logic . A computer program is a set o f instructions, perhaps but not necessarily constituting an algorithm , expressed in a form suitable for execution by a computer 2. There ar e

This publication has 1 reference indexed in Scilit: