Computing and Information Technology Interactive Digital Educational Library

 

CITIDEL >
Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10117/1255

Title: range problem
Issue Date: 14-Feb-2005
Publisher: PlanetMath
Citation: http://planetmath.org/encyclopedia/RangeProblem.html
Abstract: A ... range problem is a weakened form of a search problem. It consists of two functions ... and ... (the lower and upper bounds) and a linear ordering ... on the ranges of ... and ... . A Turing machine solves a range problem if, for any
URI: http://www.citidel.org/handle/10117/1255
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat
RangeProblem.html21KbHTMLView/Open

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