Computable real function
id:
computable-real-function-196-13549388
title:
Computable real function
text:
In mathematical logic, specifically computability theory, a function f : R → R is sequentially computable if, for every computable sequence { x i } i = 1 ∞ of real numbers, the sequence { f } i = 1 ∞ is also computable. A function f : R → R is effectively uniformly continuous if there exists a recursive function d : N → N such that, if | x − y | < 1 d then | f − f | < 1 n A real function is computable if it is both sequentially computable and effectively uniformly continuous, These definitions c
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Computable_real_function
date created:
date modified:
2020-04-27T20:47:13Z
main entity:
{"identifier":"Q5157269","url":"https://www.wikidata.org/entity/Q5157269"}
image:
fields total:
13
integrity:
13