Publications associées à Récursivement énumérable

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

Springer2022

Genetic-optimised aperiodic code for distributed optical fibre sensors

Luc Thévenaz, Marcelo Alfonso Soto Hernandez, Zhisheng Yang, Simon Adrien Zaslawski, Sheng Wang, Jian Wu

Distributed optical fibre sensors deliver a map of a physical quantity along an optical fibre, providing a unique solution for health monitoring of targeted structures. Considerable developments over recent years have pushed conventional distributed sensor ...

Nature Research2020

Enumeration of reversible functions and its application to circuit complexity

Giovanni De Micheli, Mathias Soeken, Nabila Abdessaied

We review combinational results to enumerate and classify reversible functions and investigate the application to circuit complexity. In particularly, we consider the effect of negating and permuting input and output variables and the effect of applying li ...

Springer2016

Programming with Enumerable Sets of Structures

Viktor Kuncak, Ivan Kuraj, Daniel Jackson

We present an efficient, modular, and feature-rich framework for automated generation and validation of complex structures, suitable for tasks that explore a large space of structured values. Our framework is capable of exhaustive, incremental, parallel, a ...

Assoc Computing Machinery2015

Infinite geometric frustration in a cubic dipole cluster

Tobias Schneider

The geometric arrangement of interacting (magnetic) dipoles is a question of fundamental importance in physics, chemistry, and engineering. Motivated by recent progress concerning the self-assembly of magnetic structures, the equilibrium orientation of eig ...

American Physical Society2015

Digital model-making and the encoding of design intent : notes on the computational synthesis of form

Nathaniel Zuelzke

Across many generations, including the digitally naïve and savvy, digital technologies introduce something other to the design process. This other quality ranges from inaccessibility to facile but opaque production of complexity, yet in all cases has obscu ...

EPFL2012

Recursive analysis of singular ordinary differential equations

Jürgpeter Buser

We investigate systems of ordinary differential equations with a parameter. We show that under suitable assumptions on the systems the solutions are computable in the sense of recursive analysis. As an application we give a complete characterization of the ...

Elsevier2010

On the Impossibility of Strong Encryption over ℵ0

Serge Vaudenay

We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second one relates to computationally secure encryption resisting adaptive chosen ciphe ...

Springer Berlin / Heidelberg2009

A method for the enumeration of the floppy modes and the calculation of the associated entropy

Giuseppe Foffi

We present a method that is based on the Ladd-Frenkel (LF) thermodynamic integration for the study of the rigidity of networks of particles bonded together by short-ranged square well attractive potentials. We show that, by taking the limit of the attracti ...

2008

Undecidable propositions by ODE's

Jürgpeter Buser

The authors define a family of functions by starting with (complex) exponentials and closing under some basic algebraic operations, integration, and solution of certain systems of differential equations. They then show that for every recursively (computabl ...

2007