Titlebook: Unconventional Computation and Natural Computation; 19th International C Irina Kostitsyna,Pekka Orponen Conference proceedings 2021 Springe

調(diào)色板

Bistable Latch Ising Machines,es periodically in analog/continuous mode, during which bistability is removed, helps the system traverse to better minima. CMOS realizations of BLIM have desirable practical features; implementation in other physical domains is an intriguing possibility.

Abutment

The Complexity of Multiple Handed Self-assembly,assembly proceeds by repeatedly combining up?to . assemblies together into larger assemblies. We first show that there exist shapes that are self-assembled with provably lower tile type complexities given more hands: we construct a class of shapes . that requires . tile types to self-assemble with .

直覺沒有

BROOK

Robust Real-Time Computing with Chemical Reaction Networks,omputing real numbers in real-time with chemical reaction networks (CRNs), introducing the classes . (the class of all Lyapunov CRN-computable real numbers) and . (the class of all real-time CRN-computable numbers). In their paper, they show the inclusion of the real algebraic numbers . and that . b

tooth-decay

不可磨滅

Quantum Algorithm for Dyck Language with Multiple Types of Brackets,xity ., where . is the length of input and . is the maximal nesting depth of brackets. Additionally, we show the lower bound for this problem which is . for some constant ...Interestingly, classical algorithms solving the Dyck Language for multiple types of brackets substantially differ from the alg

歌唱隊(duì)

Affine Automata Verifiers,y language is verified by a real-valued AfA verifier. Then, we focus on the verifiers restricted to have only integer-valued or rational-valued transitions. We observe that rational-valued verifiers can be simulated by integer-valued verifiers, and their protocols can be simulated in nondeterministi

Heart-Rate

String Assembling Systems: Comparison to Sticker Systems and Decidability, based on piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. So, the generative power of such systems is driven by the power of double-strands. Here we compare the generative capacity of string assembling systems with those of different varia

尖牙

patriot

Physical ZKP for Connected Spanning Subgraph: Applications to Bridges Puzzle and Other Problems, . wants to convince . that . is a connected spanning subgraph of ., i.e. . is connected and contains all vertices of .. In this paper, we propose an unconventional zero-knowledge proof protocol using a physical deck of cards, which enables . to physically show that . satisfies the condition without