About: Course-of-values recursion

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Course-of-values recursion Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/9C64hG6sVd

In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion. In a definition of a function f by course-of-values recursion, the value of f(n) is computed from the sequence .

Attributes	Values
rdfs:label	Course-of-values recursion (en)
rdfs:comment	In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion. In a definition of a function f by course-of-values recursion, the value of f(n) is computed from the sequence . (en)
dct:subject	Recursion Computability theory
Wikipage page ID	3989260 (xsd:integer)
Wikipage revision ID	1102790400 (xsd:integer)
Link from a Wikipage to another Wikipage	Primitive recursive function Recursion Computability theory Arity Gödel numbering for sequences Fibonacci number Computability theory Gödel's encoding Recursion (computer science) Primitive recursive Ackermann's function Number-theoretic function
sameAs	Course-of-values recursion Course-of-values recursion Course-of-values recursion
dbp:wikiPageUsesTemplate	dbt:= dbt:Math dbt:No_footnotes dbt:Mathematical_logic
has abstract	In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion. In a definition of a function f by course-of-values recursion, the value of f(n) is computed from the sequence . The fact that such definitions can be converted into definitions using a simpler form of recursion is often used to prove that functions defined by course-of-values recursion are primitive recursive. Contrary to course-of-values recursion, in primitive recursion the computation of a value of a function requires only the previous value; for example, for a 1-ary primitive recursive function g the value of g(n+1) is computed only from g(n) and n. (en)
prov:wasDerivedFrom	wikipedia-en:Course-of-values_recursion?oldid=1102790400&ns=0
page length (characters) of wiki page	6985 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Course-of-values_recursion
is Link from a Wikipage to another Wikipage of	Primitive recursive function Tail call Arithmetical hierarchy Mutual recursion Well-founded relation Gödel numbering Recursion Course-of-value recursion Course of values recursion
is Wikipage redirect of	Course-of-value recursion Course of values recursion
is foaf:primaryTopic of	wikipedia-en:Course-of-values_recursion

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3332 as of Dec 5 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 64 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software