Related papers: Prolegomena To Any Future Device Physics
Over the past decade, artificial intelligence has demonstrated its efficiency in many different applications and a huge number of algorithms have become central and ubiquitous in our life. Their growing interest is essentially based on…
The last two decades have seen an explosive growth in the theory and practice of both quantum computing and machine learning. Modern machine learning systems process huge volumes of data and demand massive computational power. As silicon…
The tools used to engineer something are just as important as the thing that is actually being engineered. In fact, in many cases, the tools can indeed determine what is engineerable. In fusion and fission1 energy engineering, software has…
New status in quantum mechanics is connected with recent achievements in the inverse problem. With its help instead of about ten exactly solvable models which serve as a basis of the contemporary education there are infinite (!) number,…
It is well known that physical phenomena may be of great help in computing some difficult problems efficiently. A typical example is prime factorization that may be solved in polynomial time by exploiting quantum entanglement on a quantum…
Mermin's "shut up and calculate!" somehow summarizes the most widely accepted view on quantum mechanics. This conception has led to a rather constraining way to think and understand the quantum world. Nonetheless, a closer look at the…
There is much to learn from what Turing hastily dismissed as Lady Lovelace s objection. Digital computers can indeed surprise us. Just like a piece of art, algorithms can be designed in such a way as to lead us to question our understanding…
A purported `AI Singularity' has been in the public eye recently. Mass media and US national political attention focused on `AI Doom' narratives hawked by social media influencers. The European Commission is announcing initiatives to…
Before the massive spread of computer technology, information was far from complex. The development of technology shifted the paradigm: from individuals who faced scarce and costly information to individuals who face massive amounts of…
In former work, we showed that a quantum algorithm is the sum over the histories of a classical algorithm that knows in advance 50% of the information about the solution of the problem - each history is a possible way of getting the…
This article provides a taxonomy of current and past network modeling efforts. In all these efforts over the last few years we see a trend towards not only describing the network, but connected devices as well. This is especially current…
The quantum model of homogeneous and isotropic universe filled with the uniform scalar field is considered. This model predicts effective inverse square-law dependence of the mean total energy density <\rho> on the expectation value of…
The fluctuation theorems have remained one of the cornerstones in the study of systems that are driven far out of equilibrium, and they provide strong constraints on the fraction of trajectories that behave atypically in light of the second…
This paper presents an analysis of the concept of capacity for noisy computations, i.e. algorithms implemented by unreliable computing devices (e.g. noisy Turing Machines). The capacity of a noisy computation is defined and justified by…
Since its discovery, quantum theory has proven to be one of the most precise theories ever made. Measurement processes, however, do not seem to be governed by the unitary law of quantum mechanics, and one can ask if the theory is complete.…
Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time…
Hardware, systems and algorithms research communities have historically had different incentive structures and fluctuating motivation to engage with each other explicitly. This historical treatment is odd given that hardware and software…
Infinite time Turing machines (ITTMs) have been introduced by Hamkins and Lewis in their seminal article arXiv:math/9808093. The strength of the model comes from a limit rule which allows the ITTM to compute through ordinal stages. This…
Time has been an elusive concept to grasp. Although we do not yet understand it properly, there has been advances made in regards to how we can explain it. One such advance is the Page-Wootters mechanism. In this mechanism time is seen as…
A new interpretation of quantum mechanics is proposed according to which precedence, freedom and novelty play central roles. This is based on a modification of the postulates for quantum theory given by Masanes and Muller. We argue that…