English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we prove that the general tiling problem of the hyperbolicplane is undecidable by proving a slightly stronger version using only aregular polygon as the basic shape of the tiles. The problem was raised by apaper of Raphael Robinson in 1971, in his famous simplified proof that thegeneral tiling problem is undecidable for the Euclidean plane, initially provedby Robert Berger in 1966.

The Domino Problem of the Hyperbolic Plane Is Undecidable