Computer Science – Computational Geometry
Scientific paper
2007-03-29
The Finite Tiling Problem Is Undecidable in the Hyperbolic Plane, International Journal of Foundations of Computer Science, 19
Computer Science
Computational Geometry
Scientific paper
10.1142/S0129054108006078
In this paper, we consider the finite tiling problem which was proved
undecidable in the Euclidean plane by Jarkko Kari in 1994. Here, we prove that
the same problem for the hyperbolic plane is also undecidable.
No associations
LandOfFree
The finite tiling problem is undecidable in the hyperbolic plane does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The finite tiling problem is undecidable in the hyperbolic plane, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The finite tiling problem is undecidable in the hyperbolic plane will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-711121