English
Related papers

Related papers: An origami Universal Turing Machine design

200 papers

Probabilistic graphical models (PGMs) are powerful tools for solving systems of complex relationships over a variety of probability distributions. However, while tree-structured PGMs always result in efficient and exact solutions, inference…

Machine Learning · Computer Science 2021-11-10 Simon Streicher , Johan du Preez

A quad-mesh rigid origami is a continuously deformable panel-hinge structure where planar, rigid, zero-thickness quadrilateral panels are connected by rotational hinges in the combinatorics of a grid. This article provides a comprehensive…

Metric Geometry · Mathematics 2025-07-03 Zeyuan He , Kentaro Hayakawa , Makoto Ohsaki

We propose to use a buckled plate as a qubit, where a double-well potential is mechanically produced by pushing the plate from both the sides. The right and left positions of the plate are assigned to be quantum states $|0\rangle $ and…

Quantum Physics · Physics 2023-06-27 Motohiko Ezawa , Shun Yasunaga , Akio Higo , Tetuya Iizuka , Yoshio Mita

The Joint Crossing Number problem asks for a simultaneous embedding of two disjoint graphs into one surface such that the number of edge crossings (between the two graphs) is minimized. It was introduced by Negami in 2001 in connection with…

Discrete Mathematics · Computer Science 2015-09-08 Petr Hliněný , Gelasio Salazar

we envisage a novel quantum cloning machine, which takes an input state and produces an output state whose success branch can exist in a linear superposition of multiple copies of the input state and the failure branch exist in a…

Quantum Physics · Physics 2009-01-23 Arun Kumar Pati

Topological mechanical metamaterials have been widely explored for their boundary states, which can be robustly isolated or transported in a controlled manner. However, such systems often require pre-configured design or complex active…

Mesoscale and Nanoscale Physics · Physics 2022-12-06 Yasuhiro Miyazawa , Chun-Wei Chen , Rajesh Chaunsali , Timothy S. Gormley , Gloria Yin , Georgios Theocharis , Jinkyu Yang

Automatically creating a computer program using input-output examples can be a challenging task, especially when trying to synthesize computer programs that require loops or recursion. Even though the use of recursion can make the…

Programming Languages · Computer Science 2024-06-04 Matheus Campos Fernandes , Fabrício Olivetti de França , Emilio Francesquini

Unitary braiding operators can be used as robust entangling quantum gates. We introduce a solution-generating technique to solve the $(d,m,l)$-generalized Yang-Baxter equation, for $m/2\leq l \leq m$, which allows to systematically…

Quantum Physics · Physics 2020-09-01 Pramod Padmanabhan , Fumihiko Sugino , Diego Trancanelli

We explore the surprisingly rich energy landscape of origami-like folding planar structures. We show that the configuration space of rigid-paneled degree-4 vertices, the simplest building blocks of such systems, consists of at least two…

Soft Condensed Matter · Physics 2017-09-26 Scott Waitukaitis , Rémi Menaut , Bryan Gin-ge Chen , Martin van Hecke

Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite ($*$-finite) number of bits while keeping the finite…

Mathematical Physics · Physics 2007-05-23 Ken Loo

In this paper we explore and develop a simple set of rules that apply to cutting, pasting, and folding honeycomb lattices. We consider origami-like structures that are extinsically flat away from zero-dimensional sources of Gaussian…

Soft Condensed Matter · Physics 2015-06-22 Toen Castle , Yigil Cho , Xingting Gong , Euiyeon Jung , Daniel M. Sussman , Shu Yang , Randall D. Kamien

We prove NP-completeness of Yin-Yang / Shiromaru-Kuromaru pencil-and-paper puzzles. Viewed as a graph partitioning problem, we prove NP-completeness of partitioning a rectangular grid graph into two induced trees (normal Yin-Yang), or into…

Computational Complexity · Computer Science 2021-06-30 Erik D. Demaine , Jayson Lynch , Mikhail Rudoy , Yushi Uno

Here we describe an ultra-low-cost origami-based approach for large-scale manufacturing of microscopes, specifically demonstrating brightfield, darkfield, and fluorescence microscopes. Merging principles of optical design with origami…

Optics · Physics 2015-06-19 James Cybulski , James Clements , Manu Prakash

Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two…

Quantum Physics · Physics 2018-02-06 Stephen Bigelow , Claire Levaillant

Rigid origami is examined from the perspective of rigidity theory. First and second order rigidity are defined from local differential analysis of the consistency constraint; while the static rigidity and prestress stability are defined…

Metric Geometry · Mathematics 2021-07-22 Zeyuan He , Simon D. Guest

We present an approach to overcoming challenges in dynamical dexterity for robots through tunable origami structures. Our work leverages a one-parameter family of flat sheet crease patterns that folds into origami bellows, whose axial…

Thin sheets can be assembled into tubular origami structures that combine deployability with pronounced anisotropic stiffness, enabling applications ranging from robotics to deployable systems. However, most existing tubular origami designs…

Applied Physics · Physics 2026-04-15 Mingkai Zhang , Davood Farhadi

A characterization of real numbers constructible by paper folding.

History and Overview · Mathematics 2007-09-21 Antonio M. Oller

The principles of origami design have proven useful in a number of technological applications. Origami tessellations in particular constitute a class of morphing metamaterials with unusual geometric and elastic properties. Although…

Soft Condensed Matter · Physics 2022-07-19 Hussein Nassar , Arthur Lebée , Emily Werner

We show that packing axis-aligned unit squares into a simple polygon $P$ is NP-hard, even when $P$ is an orthogonal and orthogonally convex polygon with half-integer coordinates. It has been known since the early 80s that packing unit…

Computational Geometry · Computer Science 2024-04-19 Mikkel Abrahamsen , Jack Stade
‹ Prev 1 8 9 10 Next ›