相关论文: Computable Integrability. Chapter 1: General notio…
In this thesis I present a short review of ideas in quantum information theory. The first chapter contains introductory material, sketching the central ideas of probability and information theory. Quantum mechanics is presented at the level…
We need much better understanding of information processing and computation as its primary form. Future progress of new computational devices capable of dealing with problems of big data, internet of things, semantic web, cognitive robotics…
The field of computability and complexity was, where computer science sprung from. Turing, Church, and Kleene all developed formalisms that demonstrated what they held "intuitively computable". The times change however and today's…
This monograph, written for educational purposes, serves as an introduction to the concept of integrability as it applies to systems of differential equations (both ordinary and partial) as well as to vector-valued fields. The general cases…
This is a chapter on quantum cryptography for the book "A Multidisciplinary Introduction to Information Security" to be published by CRC Press in 2011/2012. The chapter aims to introduce the topic to undergraduate-level and…
This article summarises a Web-book on "Complexity" that was developed to introduce undergraduate students to interesting complex systems in the biological, physical and social sciences, and the common tools, principles and concepts used for…
The article contains an outline of a possible new direction for Computability Logic (see www.csc.villanova.edu/~japaridz/CL/ ), focused on computability without infinite memory or other impossible-to-possess computational resources. The new…
In the book we present main concepts of probabilistic automata theory.
Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…
The purpose of this thesis is to make an analysis of the concept of Hypercomputation and of some hypermachines. This thesis is separated in three main parts. We start in the first chapter with an analysis of the concept of Classical…
In this chapter we present an overview of the main ideas and methods in the fractional integration and cointegration literature. We do not attempt to give a complete survey of this enormous literature, but rather a more introductory…
As a result of the capabilities of quantum information, the science of quantum information processing is now a prospering, interdisciplinary field focused on better understanding the possibilities and limitations of the underlying theory,…
This is an introductory review on the basic principles of quantum computation. Various important quantum logic gates and algorithms based on them are introduced. Quantum teleportation and decoherence are discussed briefly. Some problems,…
This is a short introduction to quantum computers, quantum algorithms and quantum error correcting codes. Familiarity with the principles of quantum theory is assumed. Emphasis is put on a concise presentation of the principles avoiding…
These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics.
The earlier paper "Introduction to clarithmetic I" constructed an axiomatic system of arithmetic based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html), and proved its soundness and extensional completeness with respect…
We present a brief introduction to analytic capacity, with an emphasis on its numerical computation. We also discuss several related open problems.
There is a strong consensus that combining the versatility of machine learning with the assurances given by formal verification is highly desirable. It is much less clear what verified machine learning should mean exactly. We consider this…
We initiate an investigation how the fundamental concept of independence can be represented effectively in the presence of incomplete information in relational databases. The concepts of possible and certain independence are proposed, and…
In this article, we define the notion of a filtration and then give the basic theorems on initial and progressive enlargements of filtrations.