Titlebook: Unconventional Computation and Natural Computation; 20th International C Daniela Genova,Jarkko Kari Conference proceedings 2023 The Editor(

Permanent

,Tight Bounds on?the?Directed Tile Complexity of?a?Just-Barely 3D , Rectangle at?Temperature 1,r, their upper bound does not hold for .. We close this gap for . by proving an asymptotically tight bound of . on the directed tile complexity of a just-barely 3D . rectangle at temperature-1. The proof of our lower bound is based on an algorithm that uses a novel projection of a given just-barely 3D assembly onto an equivalent, 2D assembly.

假裝是我

,Uniform Robot Relocation Is Hard in?only?Two Directions Even Without Obstacles, not blocked by a wall or other blocked robots). We show this problem is NP-complete when restricted to just two directions (south and west). This answers the simplest fundamental problem in uniform global unit tilt swarm robotics.

PAD416

,Undecidability of?the?Topological Entropy of?Reversible Cellular Automata and?Related Problems,o or not is undedicable in the class of reversible one-dimensional cellular automata. We will also show that some related decision problems are also undecidable in the setting of reversible cellular automata and reversible and complete Turing machines.

貴族

永久

蒙太奇

厚顏無恥

,Single-Shuffle Card-Based Protocol with?Eight Cards per?Gate,ction requires . cards for an .-input Boolean function that is represented by . logical gates. In this paper, we reduce the number of cards to . for arbitrary functions while keeping it working with only one shuffle.

遺留之物

生來

花爭吵