The discrepancy between syntax and semantics is a painstaking issue that hinders a better comprehension of the underlying neuronal processes in the human brain. In order to tackle the issue, we at first describe a striking correlation between Wittgenstein's Tractatus, that assesses the syntactic relationships between language and world, and Perlovsky's joint language-cognitive computational model, that assesses the semantic relationships between emotions and “knowledge instinct”. Once established a correlation between a purely logical approach to the language and computable psychological activities, (...) we aim to find the neural correlates of syntax and semantics in the human brain. Starting from topological arguments, we suggest that the semantic properties of a proposition are processed in higher brain's functional dimensions than the syntactic ones. In a fully reversible process, the syntactic elements embedded in Broca's area project into multiple scattered semantic cortical zones. The presence of higher functional dimensions gives rise to the increase in informational content that takes place in semantic expressions. Therefore, diverse features of human language and cognitive world can be assessed in terms of both the logic armor described by the Tractatus, and the neurocomputational techniques at hand. One of our motivations is to build a neuro-computational framework able to provide a feasible explanation for brain's semantic processing, in preparation for novel computers with nodes built into higher dimensions. (shrink)

The brain displays both the anatomical features of a vast amount of interconnected topological mappings as well as the functional features of a nonlinear, metastable system at the edge of chaos, equipped with a phase space where mental random walks tend towards lower energetic basins. Nevertheless, with the exception of some advanced neuro-anatomic descriptions and present-day connectomic research, very few studies have been addressing the topological path of a brain embedded or embodied in its external and internal environment. Herein, by (...) using new formal tools derived from algebraic topology, we provide an account of the metastable brain, based on the neuro-scientific model of Operational Architectonics of brain-mind functioning. We introduce a “topodynamic” description that shows how the relationships among the countless intertwined spatio-temporal levels of brain functioning can be assessed in terms of projections and mappings that take place on abstract structures, equipped with different dimensions, curvatures and energetic constraints. Such a topodynamical approach, apart from providing a biologically plausible model of brain function that can be operationalized, is also able to tackle the issue of a long-standing dichotomy: it throws indeed a bridge between the subjective, immediate datum of the naïve complex of sensations and mentations and the objective, quantitative, data extracted from experimental neuro-scientific procedures. Importantly, it opens the door to a series of new predictions and future directions of advancement for neuroscientific research. (shrink)

In the original Ulam-Rényi game with _m_ lies/errors, Player I chooses a secret number $${\bar{x}}$$ in a finite search space _S_, and Player II must guess $${\bar{x}}$$ by adaptively asking Player I a minimum number of binary questions. Up to _m_ answers may be mendacious/erroneous or may be distorted before reaching Player II. In his monograph “Fault-Tolerant Search Algorithms. Reliable Computation with Unreliable Information”, F. Cicalese provides a comprehensive account of many models of the game and their applications in (...) error-correcting coding with noiseless feedback. Since for $$m>0$$ lies the game is not called off by contradictory answers, and repeated answers to the same question are more informative than single answers, the underlying logic of the game with _m_ lies is not boolean. Indeed, the logic of Rényi-Ulam games is Łukasiewicz infinite-valued logic Ł$$_\infty$$. In this paper we consider Ulam-Rényi games with variable numbers of lies over infinite search spaces. We characterize the MV-algebras and the unital Specker $$\ell$$-groups given by the logic of these games. (shrink)

In this paper we call for attention to be paid to the link between logic and geometry. To apply this theme, we survey the connection between n-cubes, Lukasiewicz logics and Ulam games. We then extend what is known to the case where the number of permitted lies in a Ulam game exceeds 1. We conclude by identifying the precise sense in which these logics are paraconsistent.

S. Ulam asked about the number of nonisomorphic projective algebras with k generators. This paper answers his question for projective algebras of finite dimension at least three and shows that there are the maximum possible number, continuum many, of nonisomorphic one-generated structures of finite dimension n, where n is at least three, of the following kinds: projective set algebras, projective algebras, diagonal-free cylindric set algebras, diagonal-free cylindric algebras, cylindric set algebras, and cylindric algebras. The results of this paper extend (...) earlier results to the collection of cylindric set algebras and provide a uniform proof for all the results. Extensions of these results for dimension two are discussed where some modifications on the hypotheses are needed. Furthermore for α |geq 2, the number of isomorphism classes of regular locally finite cylindric set algebras of dimension α of the following two kinds are computed: ones of power κ for infinite $\kappa \geq|\alpha|$ , and ones with a single generator. (shrink)

The task of computing a function F with the help of an oracle X can be viewed as a search problem where the cost measure is the number of queries to X. We ask for the minimal number that can be achieved by a suitable choice of X and call this quantity the query complexity of F. This concept is suggested by earlier work of Beigel, Gasarch, Gill, and Owings on “Bounded query classes”. We introduce a fault tolerant version and (...) relate it with Ulam's game. For many natural classes of functions F we obtain tight upper and lower bounds on the query complexity of F. Previous results like the Nonspeedup Theorem and the Cardinality Theorem appear in a wider perspective. (shrink)

a Mathematicians, like Proust and everyone else, are at their best when writing about their first lovea (TM) a ] They are among the very best we have; and their best is very good indeed. a ] One approaches this book with high hopes. Happily, one is not disappointed. a ]In paperback it might well have become a best seller. a ]read it. From The Mathematical Intelligencer Mathematics is shaped by the consistent concerns and styles of powerful minds a three (...) of which are represented here. Kaca (TM)s work is marked by deep commitment and breadth of inquiry. Rota is the easiest of these authors to reada ]a delight: witty and urbane, with a clear and interesting agenda and an astonishing intellectual range. To read him is to be a part of a pleasant and rewarding conversation. Jacob T. Schwartz attacks problems ina ]computer science, mathematical economics, computer and instructional a ] No matter how slippery the problem, Schwartz manages to capture a substantial chunk of it in his mathematical net. a Mathematics Magazine This is a volume of essays and reviews that delightfully explore mathematics in all its moods a from the light and the witty, and humorous to serious, rational, and cerebral. Topics include: logic, combinatorics, statistics, economics, artificial intelligence, computer science, and applications of mathematics broadly. You will also find history and philosophy covered, including discussion of the work of Ulam, Kant, Heidegger among others. (shrink)

The interpretation of propositions in Lukasiewicz's infinite-valued calculus as answers in Ulam's game with lies--the Boolean case corresponding to the traditional Twenty Questions game--gives added interest to the completeness theorem. The literature contains several different proofs, but they invariably require technical prerequisites from such areas as model-theory, algebraic geometry, or the theory of ordered groups. The aim of this paper is to provide a self-contained proof, only requiring the rudiments of algebra and convexity in finite-dimensional vector spaces.

Offers a glimpse into the world of science and technology between 1950 and 1990 as seen through the eyes of a mathematician, and debunks various myths of scientific philosophy. Portrays some of the great scientific personalities of the period, including Stanislav Ulam, who patented the hydrogen bomb, and Jack Schwartz, one of the founders of computer science. Also discusses phenomenology of mathematics, and philosophy and computer science. Includes book reviews. For students and academics. Annotation copyright by Book News, Inc., (...) Portland, OR. (shrink)

We give a review of some works where it is shown that certain quantum-like features are exhibited by classical systems. Two kinds of problems are considered. The first one concerns the specific heat of crystals (the so called Fermi–Pasta–Ulam problem), where a glassy behavior is observed, and the energy distribution is found to be of Planck-like type. The second kind of problems concerns the self-interaction of a charged particle with the electromagnetic field, where an analog of the tunnel effect (...) is proven to exist, and moreover some nonlocal effects are exhibited, leading to a natural hidden variable theory which violates Bell's inequalities. (shrink)

In this paper, DSEK model with fractional derivatives of the Atangana-Baleanu Caputo is proposed. This paper gives a brief overview of the ABC fractional derivative and its attributes. Fixed point theory has been used to establish the uniqueness and existence of solutions for the fractional DSEK model. According to this theory, we will define two operators based on Lipschitzian and prove that they are contraction mapping and relatively compact. Ulam-Hyers stability theorem is implemented to prove the fractional DSEK model’s (...) stability in Banach space. Also, fractional Euler’s numerical method is derived for initial value problems with ABC fractional derivative and implemented on fractional DSEK model. The symmetric properties contribute to determining the appropriate method for finding the correct solution to fractional differential equations. The numerical solutions generated using fractional Euler’s method have been plotted for different values of α where α ∈ 0,1 and different step sizes h. Result discussion will be given, describing the changes that occur due to the step size h. (shrink)

In this article, we make analysis of the implicit fractional differential equations involving integral boundary conditions associated with Stieltjes integral and its corresponding coupled system. We use some sufficient conditions to achieve the existence and uniqueness results for the given problems by applying the Banach contraction principle, Schaefer’s fixed point theorem, and Leray–Schauder result of the cone type. Moreover, we present different kinds of stability such as Hyers–Ulam stability, generalized Hyers–Ulam stability, Hyers–Ulam–Rassias stability, and generalized Hyers–Ulam–Rassias (...) stability by using the classical technique of functional analysis. At the end, the results are verified with the help of examples. (shrink)

• alpha-beta pruning characterizes human play, but it ticed by early chess programmers—Turing, Shannon, Ulam, and Bernstein. We humans are not very good ing the heuristics we ourselves use. Approximations to used by Samuel, Newell and Simon, McCarthy. Proved lent to minimax by Hart and Levine, independently Knuth gives details.

The terms complexity, complex adaptive systems, and sciences of complexity are found often in recent scientific literature, reflecting the remarkable growth in collaborative academic research focused on complexity from the origin and dynamics of organisms to the largest social and political organizations. One of the great challenges in this field of research is to discover which features are essential and shared by all of the seemingly disparate systems that are described as complex. Is there sufficient synthesis to suggest the possibility (...) of an overarching science of complexity? This report describes current views on this subject held by various eminent scholars associated with the Santa Fe Institute.The physical sciences have traditionally been concerned with “simple” systems whose dynamics can be described in mathematical terms with precision and certainty. In contrast, the biological and social sciences are inevitably concerned with self-organized or social “complex” systems whose detailed behaviors appear to be unpredictable. The two categories differ greatly in size and diversity, prompting the late mathematician Stanislaus Ulam to remark that research on complex systems might be compared to the study of non-elephants. Nevertheless, certain integrative themes have begun to emerge.Rising activity in this field of research runs completely counter to the trend toward increasing fragmentation and specialization in the sciences. It has stimulated a resurgence of interest in a broad synthesis involving mathematics, computational science, physics, chemistry, biology, neuroscience, and the social sciences. The growth of effort in this very extended field has been greatly stimulated by the development of new computational tools that are capable of dealing with vast, interrelated databases. Many of the participants in complexity research feel that it is now time to reintegrate the fragmented interests of much of the academic community. The reader is encouraged to consider whether such views are sparking a historic renaissance of scholarship or represent a passing scientific diversion. (shrink)

Fractional calculus is nowadays an efficient tool in modelling many interesting nonlinear phenomena. This study investigates, in a novel way, the Ulam–Hyers and Ulam–Hyers–Rassias stability of differential equations with general conformable derivative. In our analysis, we employ some version of Banach fixed-point theory. In this way, we generalize several earlier interesting results. Two examples are given at the end to illustrate our results.

This study presents an Islamic conception of sovereignty from mainstream Sunni theology by closely examining Ghiyāth al-umam fī iltyāth aẓ-ẓulam, the major political work of Abū al-Ma‘ālī al-Juwayn...

We show a faithful restriction theorem among infinite chains which implies a reconstructibility conjecture of Halin. This incite us to study the reconstructibility in the sense of Fraïssé and to prove it for orders of cardinality infinite or ≥ 3 and for multirelations of cardinality infinite or ≥ 7, what improves the theory obtained by G. Lopez in the finite case. For this work we had to study the infinite classes of difference which have to be a linear order of (...) type ω, ω* or ω* + ω; this complete the theory made by G. Lopez for the finite case . We show also Ulam-reconstructibility for linear orders which have a fixed point. (shrink)

In this paper we will consider two possible definitions of projective subsets of a separable metric space X. A set A subset of or equal to X is Σ11 iff there exists a complete separable metric space Y and Borel set B subset of or equal to X × Y such that A = {x ε X : there existsy ε Y ε B}. Except for the fact that X may not be completely metrizable, this is the classical definition of (...) analytic set and hence has many equivalent definitions, for example, A is Σ11 iff A is relatively analytic in X, i.e., A is the restriction to X of an analytic set in the completion of X. Another definition of projective we denote by ΣX1 or abstract projective subset of X. A set of A subset of or equal to X is ΣX1 iff there exists an n ε ω and a Borel set B subset of or equal to X × Xn such that A = {x ε X:there existsy ε Xn ε B}. These sets ca n be far more pathological. While the family of sets Σ11 is closed under countable intersections and countable unions, there is a consistent example of a separable metric space X where ΣX1 is not closed under countable intersections or countable unions. This takes place in the Cohen real model. Assuming CH, there exists a separable metric space X such that every Σ11 set is Borel in X but there exists a Σ11 set which is not Borel in X2. The space X2 has Borel subsets of arbitrarily large rank while X has bounded Borel rank. This space is a Luzin set and the technique used here is Steel forcing with tagged trees. We give examples of spaces X illustrating the relationship between Σ11 and ΣX1 and give some consistent examples partially answering an abstract projective hierarchy problem of Ulam. (shrink)

This paper reviews some major episodes in the history of the spatial isomorphism problem of dynamical systems theory. In particular, by analysing, both systematically and in historical context, a hitherto unpublished letter written in 1941 by John von Neumann to Stanislaw Ulam, this paper clarifies von Neumann's contribution to discovering the relationship between spatial isomorphism and spectral isomorphism. The main message of the paper is that von Neumann's argument described in his letter to Ulam is the very first (...) proof that spatial isomorphism and spectral isomorphism are not equivalent because spectral isomorphism is weaker than spatial isomorphism: von Neumann shows that spectrally isomorphic ergodic dynamical systems with mixed spectra need not be spatially isomorphic. (shrink)