3 papers
cs.LO2006
Real Computational Universality: The Word Problem for a class of groups with infinite presentation
Martin Ziegler, Klaus Meer
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halti…
cs.LO2006
An Explicit Solution to Post's Problem over the Reals
Klaus Meer, Martin Ziegler
In the BCSS model of real number computations we prove a concrete and explicit semi-decidable language to be undecidable yet not reducible from (and thus strictly easier than) the…
cs.CC2004
Computing Multi-Homogeneous Bezout Numbers is Hard
Gregorio Malajovich, Klaus Meer
The multi-homogeneous Bezout number is a bound for the number of solutions of a system of multi-homogeneous polynomial equations, in a suitable product of projective spaces. Given…