Searching…
Jan 21, 2023 ... theory of bounded cohomology was developed further and extended to topological groups by Burger and Monod [8, 27]. Among the first striking ...
work of Bowen [2] on the ergodic theory of sofic groups to prove Theorem 1.7. ... Rogers, Jr., Theory of recursive functions and effective computability. 2nd ...
point of interest for geometric group theory and the theory of TDLC groups. ... Arguably the question for FP2 and FP3 should be easier because computability seems ...
between computability and randomness. One example is related to an ... [6] Chaitin, G.: A theory of program size formally identical to information theory.
Nov 20, 2003 ... The second issue which distinguishes local cyclic cohomology among most other cyclic theories is its computability in terms of homological ...
May 23, 2007 ... ... computability when dealing with argu- ments in NN. Page 13 ... Theory and Applications (Valencia, 2003), Yokohama Publ., Yokohama ...
Jan 26, 2015 ... arbitrary fiber squares as independent squares, and computability on relatively simple spaces, such as toric varieties. In future work, we ...
(i) (Polynomial computability) There exists an algorithm O which, given on in- ... [74] Ye, Y., Interior-Point Algorithms: Theory and Analysis. Wiley ...
Each of these equations can be computed in time. 2O(m) using computability of f . ... theory. While the existing approaches have failed to shed light on this, one ...
When this K-theory class is that of a higher rho invariant of an invertible differential operator, we show this pairing is precisely the aforementioned higher ...