Proving theorems by pattern recognition I
From MaRDI portal
Publication:3283226
DOI10.1145/367177.367224zbMath0101.10504OpenAlexW1977420943MaRDI QIDQ3283226
Publication date: 1960
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/367177.367224
Related Items (12)
The Domino Problem for Self-similar Structures ⋮ Aperiodic points in $\mathbb Z^2$-subshifts ⋮ Strongly aperiodic subshifts of finite type on hyperbolic groups ⋮ DPLL: The Core of Modern Satisfiability Solvers ⋮ Leader election on two-dimensional periodic cellular automata ⋮ Slopes of multidimensional subshifts ⋮ On timeline-based games and their complexity ⋮ Two-dimensional models ⋮ Beweisalgorithmen für die Prädikatenlogik ⋮ Weak colored local rules for planar tilings ⋮ On proof retrieval: Problem-solving machines, I ⋮ Decidability and undecidability in cellular automata
This page was built for publication: Proving theorems by pattern recognition I
