Search results for "Formal language"
showing 10 items of 357 documents
Integer Weighted Regression Tsetlin Machines
2020
The Regression Tsetlin Machine (RTM) addresses the lack of interpretability impeding state-of-the-art nonlinear regression models. It does this by using conjunctive clauses in propositional logic to capture the underlying non-linear frequent patterns in the data. These, in turn, are combined into a continuous output through summation, akin to a linear regression function, however, with non-linear components and binary weights. However, the resolution of the RTM output is proportional to the number of clauses employed. This means that computation cost increases with resolution. To address this problem, we here introduce integer weighted RTM clauses. Our integer weighted clause is a compact r…
Of Many, Many Other Things
2021
Propositions of everyday discourse can have, unlike those of formal languages, other components over and above the predicate and the terms needed to saturate it. These components are of two very different sorts: adverbs and further individual terms. Only adverbs have already been discussed by other writers in this connection; but they are not the whole story.
Ethics in designing intelligent systems
2019
The idea of Hume’s guillotine contains the argument that one cannot derive values from facts. As intelligent systems operate with facts, Hume’s famous dilemma seems to contradict the very idea of being able to create ethical intelligent systems. In a closer look, ethics is a system of rules guiding actions. Actions always have factual or cognitive aspects, as well as evaluative or emotional aspects. Therefore, Hume’s juxtaposition of facts and norms is not well-founded. Instead of separating the facts and norms it should rather ask what kinds of facts are associated to what kinds of norms. Consequently, Hume’s guillotine sets no limits in processing ethical information, as one can combine f…
A Musical Pattern Discovery System Founded on a Modeling of Listening Strategies
2004
Music is a domain of expression that conveys a paramount degree of complexity. The musical surface, composed of a multitude of notes, results from the elaboration of numerous structures of different types and sizes. The composer constructs this structural complexity in a more or less explicit way. The listener, faced by such a complex phenomenon, is able to reconstruct only a limited part of it, mostly in a non-explicit way. One particular aim of music analysis is to objectify such complexity, thus offering to the listener a tool for enriching the appreciation of music (Lartillot and SaintJames, 2004). The trouble is, traditional musical analysis, although offering a valuable understanding …
Grammar is the heart of language : grammar and its role in language learning among Finnish university students
2015
This article presents and discusses views on grammar and its role in formal language learning amongst Finnish university students. The results are based on a questionnaire which was distributed to students at the University of Jyväskylä as part of institutional action research. The background to the project was a feeling amongst some teachers of increased divergence between student respectively language teacher understandings of the role of grammar in language teaching. This concern raised the need to find out how students view grammar. The knowledge about thoughts on grammar amongst students would then help teachers to adjust and adept the way grammar is used in language teaching. The main…
THE CONE OF EXPERIENCE IN TEACHING MATHEMATICS SYNCHRONOUSLY AND ASYNCHRONOUSLY
2021
Teaching online is a new challenge for every single teacher. Mathematics in particular remains the school subject that requires special teaching tools. This article describes Edgar Dale’s «Cone of experience» and Bruner’s learning approaches for synchronous and asynchronous teaching in Mathematics. It also describes the most important tools that can be used for online teaching in a combination of both formats, asynchronous and synchronous. These teaching methods are described not only in terms of digital tools, but also in terms of Jerome Bruner’s theories on information processing.
FO^2 with one transitive relation is decidable
2013
We show that the satisfiability problem for the two-variable first-order logic, FO^2, over transitive structures when only one relation is required to be transitive, is decidable. The result is optimal, as FO^2 over structures with two transitive relations, or with one transitive and one equivalence relation, are known to be undecidable, so in fact, our result completes the classification of FO^2-logics over transitive structures with respect to decidability. We show that the satisfiability problem is in 2-NExpTime. Decidability of the finite satisfiability problem remains open.
The double cone: a mechanical paradox or a geometrical constraint?
2011
In the framework of the Italian National Plan ‘Lauree Scientifiche’ (PLS) in collaboration with secondary schools, we have investigated the mechanical paradox of the double cone. We have calculated the geometric condition for obtaining an upward movement. Based on this result, we have built a mechanical model with a double cone made of aluminum and a couple of wooden rails.
Unambiguous recognizable two-dimensional languages
2006
We consider the family UREC of unambiguous recognizable two-dimensional languages. We prove that there are recognizable languages that are inherently ambiguous, that is UREC family is a proper subclass of REC family. The result is obtained by showing a necessary condition for unambiguous recognizable languages. Further UREC family coincides with the class of picture languages defined by unambiguous 2OTA and it strictly contains its deterministic counterpart. Some closure and non-closure properties of UREC are presented. Finally we show that it is undecidable whether a given tiling system is unambiguous.
Weak and strong recognition by 2-way randomized automata
1997
Languages weakly recognized by a Monte Carlo 2-way finite automaton with n states are proved to be strongly recognized by a Monte Carlo 2-way finite automaton with no(n) states. This improves dramatically over the previously known result by M.Karpinski and R.Verbeek [10] which is also nontrivial since these languages can be nonregular [5]. For tally languages the increase in the number of states is proved to be only polynomial, and these languages are regular.