Ker-I Ko, Complexity of real functions, Birkhauser, Basel-Berlin-Boston (1991)  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the computational complexity of sets of positive integers, yet, even in the original paper of Turing [23] a central topic is interest in e ectiveness considerations for reals. Of particular interest to computable analysis (e.g. Weihrauch [24] Pour El [17] Pour El and Richards [18] Ko [12]) and to algorithmic information theory (e.g. Chaitin [6] Calude [2] Martin L of [16] Li Vitanyi [14] is the collection of computably enumerable reals. As in Soare [20] a real is computably enumerable if we can e ectively generate it from, say, below. That is, there is a computable ....

Ko, Ker-I, Complexity of Real Functions, Birkhauser, Berlin, 1991.

....the computational complexity of sets of positive integers, yet, even in the original paper of Turing [57] a central topic is interest in e ectiveness considerations for reals. Of particular interest to computable analysis (e.g. Weihrauch [59] PourEl [45] Pour El and Richards [46] Ko [32]) and to algorithmic information theory (e.g. Chaitin [11] Calude [6] Martin L of [44] Li Vitanyi [41] is the collection of computably enumerable reals. These are the reals such the lower cut L( consisting of rationals less than forms a computably enumerable set. The rst part of these ....

Ko, Ker-I, Complexity of Real Functions, Birkhauser, Berlin, 1991.

....in 1941 by Shannon [18] as a mathematical model of an analog device, the Di#erential Analyzer [2] This device was one of the first (analog) computers to appear and was intended to solve numerical problems, especially di#erential equations. Unlikely to the approach in computable analysis [14, 10, 21], the GPAC is not directly based on the Turing machine, neither on some e#ective procedures. The model basically consists of circuits composed of black boxes as indicated in Fig. 1.1 (the so called analog units. These are not the units originally used by Shannon, but they are equivalent) It is ....

Ker-I-Ko. Complexity of Real Functions, Birkhauser, 1991.

.... 1 2 Computable and Uncomputable Reals The complexity of real numbers is a central topic in classical computability theory (see Turing [53] Rice [43] Calude [6] Soare [47] Odifreddi [39] Bridges [5] computable analysis (see Martin L of [38] Weihrauch [55] Pour El and Richards [42] Ko [34], Bridges [4] algorithmic information theory (see Chaitin [23, 25, 26] Martin L of [36] Calude [7] and information based complexity (see Traub, Wasilkowski, and Wo zniakowski [52] A important class of reals is certainly the set of computable reals. In order to de ne them we introduce the ....

Ker-I, Ko. Complexity of Real Functions, Birkhauser, Berlin, 1991.

No context found.

Ker-I Ko, Complexity of real functions, Birkhauser, Basel-Berlin-Boston (1991)

No context found.

Ker-I Ko, Complexity of real functions (Birkhauser, Basel-Berlin-Boston, 1991).

No context found.

Ko, K.-I, Complexity of Real Functions, Birkhauser, Berlin, 1991.

No context found.

Ker-I Ko, Complexity of real functions,Birkhauser, Basel-Berlin-Boston (1991).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC