AI as Arational Intelligence?

We introduce the notion of arational realisations of abilities. In computer science, rationality often refers to the concept of a rational agent, which is defined by the function or behavior of the agent. We focus in the way how this behavior is described and encoded. We build up on the definition of a rational process/method/argument by Günter Ropohl, which focuses on the interpretability and communicability of the realisation of said process/method. We compare arational with rational realisations of abilities and discuss key questions appearing if arationally realised methods are employed in data science. We further analyse the relevance of arational realisations of abilities for the generation of mathematical proofs, an extreme formof communicable arguments. We conclude that modern computer science could profit from a more intensive and more technical discussion with different branches of theoretical philosophy

Decentralized financing of Fairtrade producers using a blockchain-based solution

Fairtrade producers in developing countries often have a stable business model and substantial growth opportunities. Due to the missing or insufficient finance infrastructure in the respective countries, Fairtrade producers do not have the opportunity to realize their growth opportunities. Although some impact investors address this problem in the area of smaller agricultural companies, the existing financing solutions are lacking flexibility or the barriers (e.g. credit collaterals) are too high. In a primary study, the practicability of a blockchain-based model was analyzed, considering the economic, legal, and technological perspective. Since the feasibility has been confirmed during the primary study, this larger research project aims to develop and implement the model

From hierarchies to well-foundedness

We highlight that the connection of well-foundedness and recursive definitions is more than just convenience. While the consequences of making well-foundedness a sufficient condition for the existence of hierarchies (of various complexity) have been extensively studied, we point out that (if parameters are allowed) well-foundedness is a necessary condition for the existence of hierarchies e.g. that even in an intuitionistic setting $${(\Pi_1^0-\mathsf{CA}_0)_\alpha \vdash \mathsf{wf}(\alpha)\, {\rm where}\, (\Pi_1^0-\mathsf{CA}_0)_\alpha}$$ ( Π 1 0 - CA 0 ) α ⊢ wf ( α ) where ( Π 1 0 - CA 0 ) α stands for the iteration of $${\Pi^0_1}$$ Π 1 0 comprehension (with parameters) along some ordinal $${\alpha}$$ α and $${\mathsf{wf}(\alpha)}$$ wf ( α ) stands for the well-foundedness of $${\alpha}$$ α

A compiler framework to derive microfluidic platforms for manufacturing hierarchical, compartmentalized structures that maximize yield of chemical reactions

In this work, we propose a framework that derives the configuration of an artificial, compartmentalized, cell-like structure in order to maximize the yield of a desired output reactant given a formal description of the chemistry. The configuration of the structure is then used to compile G-code for 3D printing of a microfluidic platform able to manufacture the aforementioned structure. Furthermore, the compiler output includes a set of pressure profiles to actuate the valves at the input of the microfluidic platform. The work includes an outline of the steps involved in the compilation process and a discussion of the algorithms needed for each step. Finally, we provide formal, declarative languages for the input and output interfaces of each of these steps

Foundations of Data Science : a comprehensive overview formed at the 1st International Symposium on the Science of Data Science

We present a summary of the 1st International Symposium on the Science of Data Science, organized in Summer 2021 as a satellite event of the 8th Swiss Conference on Data Science held in Lucerne, Switzerland. We discuss what establishes the scientific core of the discipline of data science by introducing the corresponding research question, providing a concise overview of relevant related prior work, followed by a summary of the individual workshop contributions. Finally, we expand on the common views which were formed during the extensive workshop discussions

A chemical compiler for the synthesis of branched oligomers on standardized chemical reaction structures

This research paper presents a chemical compiler developed to find optimal configurations of a platform for synthesizing specific branched oligomers in an artificial chemistry, along with exemplary compiler output and benchmarks where the platform configuration suggested by the compiler is compared to other configurations in simulation. The compiler operates as a pipeline with two stages: labelling and optimization. The report explains the structure of the compiler target and its interpretation, followed by a code walk-through of the compiler stages with code snippets and examples. The compiler can be used as a code generator for reactions in a chemical simulator and to derive loading schemes for multilevel droplets. The results obtained in simulations suggest that the container system can efficiently optimize the yield of coupled reaction networks and that multi-level droplets can lead to significant improvements

Influence of the geometry on the agglomeration of a polydisperse binary system of spherical particles

Within the context of the European Horizon 2020 project ACDC, we intend to develop a probabilistic chemical compiler, to aid the construction of three-dimensional agglomerations of artificial hierarchical cellular constructs. These programmable discrete units offer a wide variety of technical innovations, like a portable biochemical laboratory that e.g. produces macromolecular medicine on demand. For this purpose, we have to investigate the agglomeration process of droplets and vesicles under proposed constraints, like confinement. This paper focuses on the influence of the geometry of the initialization and of the container on the agglomeration

Paths in a network of polydisperse spherical droplets

We simulate the movement and agglomeration of oil droplets in water under constraints, like confinement, using a simplified stochastic-hydrodynamic model. In the analysis of the network created by the droplets in the agglomeration, we focus on the paths between pairs of droplets and compare the computational results for various system sizes

Percolation breakdown in binary and ternary monodisperse and polydisperse systems of spherical particles

We perform computer simulations of an agglomeration process for monodisperse and polydisperse systems of spherical particles in a cylindrical container, using a simplified stochastic-hydrodynamic model. We consider a ternary system with three particle types A, B, and C, in which only connections of the type can be forged, while any other connections with particles of the same type or with C-particles are forbidden, and for comparison a binary system with two particle types A and C, in which only connections of the type can be formed. We study the breakdown of the percolation in the agglomeration at the bottom of the cylinder with an increasing fraction of C-particles