About: Computable real function

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In mathematical logic, specifically computability theory, a function is sequentially computable if, for every of real numbers, the sequence is also computable. A function is effectively uniformly continuous if there exists a recursive function such that, if then A real function is computable if it is both sequentially computable and effectively uniformly continuous, Let be a subset of A function is sequentially computable if, for every -tuplet of computable sequences of real numbers such that the sequence is also computable.

Property Value
dbo:abstract
  • In mathematical logic, specifically computability theory, a function is sequentially computable if, for every of real numbers, the sequence is also computable. A function is effectively uniformly continuous if there exists a recursive function such that, if then A real function is computable if it is both sequentially computable and effectively uniformly continuous, These definitions can be generalized to functions of more than one variable or functions only defined on a subset of The generalizations of the latter two need not be restated. A suitable generalization of the first definition is: Let be a subset of A function is sequentially computable if, for every -tuplet of computable sequences of real numbers such that the sequence is also computable. This article incorporates material from Computable real function on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License. (en)
dbo:wikiPageID
  • 17202561 (xsd:integer)
dbo:wikiPageLength
  • 2069 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 953556315 (xsd:integer)
dbo:wikiPageWikiLink
dbp:id
  • 6248 (xsd:integer)
dbp:title
  • Computable real function (en)
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In mathematical logic, specifically computability theory, a function is sequentially computable if, for every of real numbers, the sequence is also computable. A function is effectively uniformly continuous if there exists a recursive function such that, if then A real function is computable if it is both sequentially computable and effectively uniformly continuous, Let be a subset of A function is sequentially computable if, for every -tuplet of computable sequences of real numbers such that the sequence is also computable. (en)
rdfs:label
  • Computable real function (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License