Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Range_problem> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items per page.
- Range_problem abstract "In computability theory, a range problem is a weakened form of a search problem. It consists of two functions fl and fu (the lower and upper bounds) and a linear ordering < on the ranges of f1 and f2. A Turing machine solves a range problem if, for any x, the machine eventually halts with an output y such that f1(x) < y < f2(x).For example, given any function f with range in R and any g : N → R, the strong range problem StrongRangeg(f) is given by lower boundand upper bound.Note that g is passed the length of x, not the value, which need not even be a number.This article incorporates material from range problem on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.".
- Range_problem wikiPageID "1471738".
- Range_problem wikiPageRevisionID "586412597".
- Range_problem hasPhotoCollection Range_problem.
- Range_problem id "3442".
- Range_problem title "range problem".
- Range_problem subject Category:Theory_of_computation.
- Range_problem comment "In computability theory, a range problem is a weakened form of a search problem. It consists of two functions fl and fu (the lower and upper bounds) and a linear ordering < on the ranges of f1 and f2.".
- Range_problem label "Range problem".
- Range_problem sameAs m.0545bn.
- Range_problem sameAs Q7292707.
- Range_problem sameAs Q7292707.
- Range_problem wasDerivedFrom Range_problem?oldid=586412597.
- Range_problem isPrimaryTopicOf Range_problem.