The following pages link to Zheng, Xizhong (Q162063):
Displaying 50 items.
- Relatively computably enumerable reals (Q535150) (← links)
- The computational complexity of distance functions of two-dimensional domains (Q557838) (← links)
- (Q585943) (redirect page) (← links)
- On the maximality of some pairs of p-t degrees (Q689190) (← links)
- (Q809073) (redirect page) (← links)
- The density of infima in the recursively enumerable degrees (Q809074) (← links)
- Divergence bounded computable real numbers (Q817855) (← links)
- A hierarchy of Turing degrees of divergence bounded computable real numbers (Q864432) (← links)
- Computing Schrödinger propagators on type-2 Turing machines (Q864440) (← links)
- On a complexity-based way of constructivizing the recursive functions (Q922528) (← links)
- Complexity for type-2 relations (Q922532) (← links)
- Classification of computably approximable real numbers (Q1015380) (← links)
- The hierarchy and Grzegorczyk's problem of multiple recursive functions (Q1202816) (← links)
- Generalizations of enumeration reducibility using recursive infinitary propositional sentences (Q1207542) (← links)
- Minimal \(m\)-powers (Q1280646) (← links)
- Effectiveness of the global modulus of continuity on metric spaces (Q1292416) (← links)
- Branching in the enumeration degrees of the \(\Sigma_2^0\) sets (Q1293973) (← links)
- Sets of generator and automorphism bases for the enumeration degrees (Q1295393) (← links)
- The dense simple sets are orbit complete with respect to the simple sets (Q1295401) (← links)
- The rhombus classes of degrees of unsolvability. I. The jump properties (Q1322450) (← links)
- Isolated d.r.e. degrees are dense in r.e. degree structure (Q1354326) (← links)
- A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees (Q1368585) (← links)
- Resource bounded randomness and weakly complete problems (Q1392022) (← links)
- On the hierarchy and extension of monotonically computable real numbers. (Q1426053) (← links)
- (Q1575669) (redirect page) (← links)
- Computability on continuous, lower semi-continuous and upper semi-continuous real functions (Q1575670) (← links)
- The closure properties on real numbers under limits and computable operators. (Q1607302) (← links)
- Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines (Q1770395) (← links)
- Effective Jordan decomposition (Q1771318) (← links)
- Isolated d-r.e. degree below r.e. degree (Q1895496) (← links)
- Recursion theoretic properties of frequency computation and bounded queries (Q1898479) (← links)
- Interpreting true arithmetic in the theory of the r.e. truth table degrees (Q1902619) (← links)
- The last question on recursively enumerable \(m\)-degrees (Q1908450) (← links)
- Correlations between e-degrees and T-degrees (Q1909815) (← links)
- Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree (Q1916896) (← links)
- On the differences and sums of strongly computably enumerable real numbers (Q2179375) (← links)
- A computable version of the Daniell-Stone theorem on integration and linear functionals (Q2503282) (← links)
- Closure properties of real number classes under CBV functions (Q2581007) (← links)
- The Arithmetical Hierarchy of Real Numbers (Q2707071) (← links)
- (Q2752157) (← links)
- (Q2766825) (← links)
- Point-Separable Classes of Simple Computable Planar Curves (Q2914236) (← links)
- (Q2917334) (← links)
- On the Divergence Bounded Computable Real Numbers (Q3082917) (← links)
- Degrees of d. c. e. reals (Q3159420) (← links)
- Weak computability and representation of reals (Q3159428) (← links)
- Points on Computable Curves of Computable Lengths (Q3182970) (← links)
- (Q3505898) (← links)
- Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals (Q3608858) (← links)
- (Q3984867) (← links)
