### Abstract

A new model of computation called VH-system is introduced. It is a formalization of domino tilings. We show how the semantics of nondeterminism on VH-systems, being a natural counterpart of the machinery of tilings, can be modified to cover both deterministic and alternating computations. As a by-product we present a new proof of the fact that the satisfiability problem of boolean Horn formulas is complete in PTIME.

Original language | English (US) |
---|---|

Title of host publication | Computation Theory - 5th Symposium, Proceedings |

Editors | Andrzej Skowron |

Publisher | Springer Verlag |

Pages | 24-33 |

Number of pages | 10 |

ISBN (Print) | 9783540160663 |

DOIs | |

State | Published - Jan 1 1985 |

Externally published | Yes |

Event | 5th Symposium on Computation Theory, SCT 1984 - Zaborow, Poland Duration: Dec 3 1984 → Dec 8 1984 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 208 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 5th Symposium on Computation Theory, SCT 1984 |
---|---|

Country | Poland |

City | Zaborow |

Period | 12/3/84 → 12/8/84 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'From domino tilings to a new model of computation'. Together they form a unique fingerprint.

## Cite this

Chlebus, B. S. (1985). From domino tilings to a new model of computation. In A. Skowron (Ed.),

*Computation Theory - 5th Symposium, Proceedings*(pp. 24-33). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 208 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-16066-3_4