Related papers: The Free Will Function
We present sufficient conditions for the existence of forced oscillations in non-autonomous mechanical systems. Previously, similar results were obtained for systems with friction. Presented results hold both for systems with and without…
We present a self-contained formulation of spin-free nonrelativistic quantum mechanics that makes no use of wavefunctions or complex amplitudes of any kind. Quantum states are represented as ensembles of real-valued quantum trajectories,…
In the present article we use the quantum formalism to describe the process of choice under rational ignorance. We consider as a basic task a question or an issue where the only answers are 0 and 1. We show that under rational ignorance the…
General wisdom is, mathematical operation is needed to generate number by numbers. It is pointed out that without any mathematical operation true random numbers can be generated by numbers through algorithmic process. It implies that human…
This text is meant for analysis students who want to learn more about the effects of the axiom of choice on functional analysis, and the things that may go wrong in its absence. As this is a text aimed for analysis students, we will not…
We introduce a logic for reasoning about evidence, that essentially views evidence as a function from prior beliefs (before making an observation) to posterior beliefs (after making the observation). We provide a sound and complete…
In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as a deterministic counterpart to the Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. A…
This paper articulates metacognition using the language of statistical physics and Bayesian mechanics. Metacognitive beliefs, defined as beliefs about beliefs, find a natural description within this formalism, which allows us to define the…
Recently it has been claimed that no extension of quantum theory can have improved predictive power, the statement following, according to the authors, from the assumptions of free will and of the correctness of quantum predictions…
The propositional logic is generalized on the real numbers field. The logical analog of the Bernoulli independent tests scheme is constructed. The variant of the nonstandard analysis is adopted for the definition of the logical function,…
We explore a functionalist approach to emotion by employing an ansatz -- an initial set of assumptions -- that a hypothetical concept generation model incorporates unproven but biologically plausible traits. From these traits, we…
Bounded rationality, that is, decision-making and planning under resource limitations, is widely regarded as an important open problem in artificial intelligence, reinforcement learning, computational neuroscience and economics. This paper…
We revisit the vexed question of how unpredictability can arise in a deterministic universe, focusing on unitary quantum theory. We discuss why quantum unpredictability is irrelevant for the possibility of what some people call `free-will',…
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but…
Developing suitable formal semantics can be of great help in the understanding, design and implementation of a programming language, and act as a guide for software development tools like analyzers or partial evaluators. In this sense, full…
We introduce a logic for reasoning about evidence that essentially views evidence as a function from prior beliefs (before making an observation) to posterior beliefs (after making the observation). We provide a sound and complete…
Perfectly rational decision-makers maximize expected utility, but crucially ignore the resource costs incurred when determining optimal actions. Here we propose an information-theoretic formalization of bounded rational decision-making…
We prove a theorem stating that any semantics can be encoded as a compositional semantics, which means that, essentially, the standard definition of compositionality is formally vacuous. We then show that when compositional semantics is…
The use of non-deterministic functions is a distinctive feature of modern functional logic languages. The semantics commonly adopted is call-time choice, a notion that at the operational level is related to the sharing mechanism of lazy…
A workflow describes the entirety of processing steps in an analysis, such as employed in many fields of physics. Workflow management makes the dependencies between individual steps of a workflow and their computational requirements…