Logic and Foundations Commons^™

Lowness And Π Nullsets, Rod Downey, Andre Nies, Rebecca Weber, Liang Yu

Dartmouth Scholarship

We prove that there exists a noncomputable c.e. real which is low for weak 2-randomness, a definition of randomness due to Kurtz, and that all reals which are low for weak 2-randomness are low for Martin-Lof randomness.

François Viète, Between Analysis And Cryptanalysis, Marco Panza

MPP Published Research

François Viète is considered the father both of modern algebra and of modern cryptanalysis. The paper outlines Viète's major contributions in these two mathematical fields and argues that, despite an obvious parallel between them, there is an essential difference. Viète's 'new algebra' relies on his reform of the classical method of analysis and synthesis, in particular on a new conception of analysis and the introduction of a new formalism. The procedures he suggests to decrypt coded messages are particular forms of analysis based on the use of formal methods. However, Viète's algebraic analysis is not an analysis in the same …

Application Of Fuzzy State Aggregation And Policy Hill Climbing To Multi-Agent Systems In Stochastic Environments, Dean C. Wardell

Theses and Dissertations

Reinforcement learning is one of the more attractive machine learning technologies, due to its unsupervised learning structure and ability to continually even as the operating environment changes. Applying this learning to multiple cooperative software agents (a multi-agent system) not only allows each individual agent to learn from its own experience, but also opens up the opportunity for the individual agents to learn from the other agents in the system, thus accelerating the rate of learning. This research presents the novel use of fuzzy state aggregation, as the means of function approximation, combined with the policy hill climbing methods of Win …

Enumerations Of The Kolmogorov Function, Richard Beigel, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet

Computer Science Faculty Publication Series

A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x). f is a k(n)-enumerator if for every input x of length n, h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A.

We determine exactly how hard it is to enumerate the Kolmogorov function, which assigns to each string x its Kolmogorov complexity:

• For every underlying universal machine U, there is a constant a …

Place-Valued Logics Around Cybernetic Ontology, The Bcl And Afosr, Rudolf Kaehr

Rudolf Kaehr

No abstract provided.

From Ruby To Rudy, Rudolf Kaehr

Rudolf Kaehr

No abstract provided.

The Chinese Challenge. Hallucinations For Other Futures, Rudolf Kaehr

Rudolf Kaehr

The main question is: What can we learn from China that China is not teaching us? It is proposed that a study of polycontextural logic and morphogrammatics could be helpful to discover this new kind of rationality.

Enumerations Of The Kolmogorov Function, Richard Beigel, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet

Peter Fejer

A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x). f is a k(n)-enumerator if for every input x of length n, h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A.

We determine exactly how hard it is to enumerate the Kolmogorov function, which assigns to each string x its Kolmogorov complexity:

• For every underlying universal machine U, there is a constant a …

Coalgebras And Their Logics, Alexander Kurz

Engineering Faculty Articles and Research

"Transition systems pervade much of computer science. This article outlines the beginnings of a general theory of specification languages for transition systems. More specifically, transition systems are generalised to coalgebras. Specification languages together with their proof systems, in the following called (logical or modal) calculi, are presented by the associated classes of algebras (e.g., classical propositional logic by Boolean algebras). Stone duality will be used to relate the logics and their coalgebraic semantics."

Sequences Of Numbers Involved In Unsolved Problems, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Here it is a long list of sequences, functions, unsolved problems, conjectures, theorems, relationships, operations, etc. Some of them are inter-connected. 1) Consecutive Sequence: 1,12,123,1234,12345,123456,1234567,12345678,123456789,12345678910, 1234567891011,123456789101112,12345678910111213,... How many primes are there among these numbers? In a general form, the Consecutive Sequence is considered in an arbitrary numeration base B.

References:

Student Conference, University of Craiova, Department of Mathematics, April 1979, "Some problems in number theory" by Florentin Smarandache.

Arizona State University, Hayden Library, "The Florentin Smarandache papers" special collection, Tempe, AZ 85287-1006, USA.

The Encyclopedia of Integer Sequences", by N. J. A. Sloane and S. Plouffe, Academic Press, San Diego, …

Fuzzy Interval Matrices, Neutrosophic Interval Matrices And Their Applications, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The new concept of fuzzy interval matrices has been introduced in this book for the first time. The authors have not only introduced the notion of fuzzy interval matrices, interval neutrosophic matrices and fuzzy neutrosophic interval matrices but have also demonstrated some of its applications when the data under study is an unsupervised one and when several experts analyze the problem. Further, the authors have introduced in this book multiexpert models using these three new types of interval matrices. The new multi expert models dealt in this book are FCIMs, FRIMs, FCInMs, FRInMs, IBAMs, IBBAMs, nIBAMs, FAIMs, FAnIMS, etc. Illustrative …

Some Neutrosophic Algebraic Structures And Neutrosophic N-Algebraic Structures, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book, for the first time we introduce the notion of neutrosophic algebraic structures for groups, loops, semigroups and groupoids and also their neutrosophic N-algebraic structures. One is fully aware of the fact that many classical theorems like Lagrange, Sylow and Cauchy have been studied only in the context of finite groups. Here we try to shift the paradigm by studying and introducing these theorems to neutrosophic semigroups, neutrosophic groupoids, and neutrosophic loops. We have intentionally not given several theorems for semigroups and groupoid but have given several results with proof mainly in the case of neutrosophic loops, biloops …