Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5164405> ?p ?o }
Showing triples 1 to 13 of
13
with 100 triples per page.
- Q5164405 subject Q6863978.
- Q5164405 subject Q7451559.
- Q5164405 abstract "In complexity theory, a time-constructible function is a function f from natural numbers to natural numbers with the property that f(n) can be constructed from n by a Turing machine in the time of order f(n). The purpose of such a definition is to exclude functions that do not provide an upper bound on the runtime of some Turing machine.".
- Q5164405 wikiPageWikiLink Q163310.
- Q5164405 wikiPageWikiLink Q205084.
- Q5164405 wikiPageWikiLink Q21199.
- Q5164405 wikiPageWikiLink Q269878.
- Q5164405 wikiPageWikiLink Q5251122.
- Q5164405 wikiPageWikiLink Q6863978.
- Q5164405 wikiPageWikiLink Q7451559.
- Q5164405 wikiPageWikiLink Q7572588.
- Q5164405 comment "In complexity theory, a time-constructible function is a function f from natural numbers to natural numbers with the property that f(n) can be constructed from n by a Turing machine in the time of order f(n). The purpose of such a definition is to exclude functions that do not provide an upper bound on the runtime of some Turing machine.".
- Q5164405 label "Constructible function".