Search results for "Inductive reasoning"
showing 10 items of 54 documents
Two Views for Understanding How TQM Fosters Learning and Value Innovation: Absorptive Capabilities and Action-Based Management
2014
In the last decade some frameworks have tried to explain how to devise strategies for innovation in value by determining the needs of customers and non-customers, also creating new industries in which competition becomes irrelevant (Hax, The delta model. Reinventing your business strategy. New York: Springer, 2010; Kim and Mauborgne, Blue ocean strategy. Boston: Harvard Business School Press, 2005; Madhok and Marques 2013). These reference frameworks are based on a common set of principles: Value is created through the relationship with the customer (Priem, Acad Manag Rev 23; 219–235, 2007; Vargo and Lusch 2008); Strategy is considered to be a continuous process of exploring new opportuniti…
Active Learning of Recursive Functions by Ultrametric Algorithms
2014
We study active learning of classes of recursive functions by asking value queries about the target function f, where f is from the target class. That is, the query is a natural number x, and the answer to the query is f(x). The complexity measure in this paper is the worst-case number of queries asked. We prove that for some classes of recursive functions ultrametric active learning algorithms can achieve the learning goal by asking significantly fewer queries than deterministic, probabilistic, and even nondeterministic active learning algorithms. This is the first ever example of a problem where ultrametric algorithms have advantages over nondeterministic algorithms.
Ancient Theories of Reasoning
2013
In this section, the central question is whether we can find ancient discussions concerning what happens in the mind when a conclusion is drawn. Did ancient authors suppose that there is a psychological force that compels us to accept the conclusion when the premises are accepted and the inference is valid? Or, if the inference is not deductively valid but adds to the credibility of the conclusion in another way, e.g., by being inductive, what happens in the mind when such an inference is drawn? In general, psychology of reasoning was not a vital topic in antiquity. Reasoning was typically considered from a logical, not from a psychological point of view. For example, in Stoic sources the n…
Eritrean teachers' perceptions of learner-centred interactive pedagogy
2021
In most sub-Saharan African countries, mainstreaming learner-centred interactive pedagogy (LCIP) is defined as a policy priority. Similarly, Eritrea has adopted the same policy to seek a solution to its educational challenges. Rather than rote mastery of course content, the LCIP approach prioritises learners in constructing knowledge through interaction, active participation and controlling the learning process. This paper explores secondary school teachers' perceptions of LCIP and their challenges in implementing this pedagogical approach. Constructivism and sociocultural learning theory are considered conceptual frameworks to highlight LCIP as an approach for teaching and learning. Qualit…
Co-learning of recursive languages from positive data
1996
The present paper deals with the co-learnability of enumerable families L of uniformly recursive languages from positive data. This refers to the following scenario. A family L of target languages as well as hypothesis space for it are specified. The co-learner is fed eventually all positive examples of an unknown target language L chosen from L. The target language L is successfully co-learned iff the co-learner can definitely delete all but one possible hypotheses, and the remaining one has to correctly describe L.
On the intrinsic complexity of learning
1995
A new view of learning is presented. The basis of this view is a natural notion of reduction. We prove completeness and relative difficulty results. An infinite hierarchy of intrinsically more and more difficult to learn concepts is presented. Our results indicate that the complexity notion captured by our new notion of reduction differs dramatically from the traditional studies of the complexity of the algorithms performing learning tasks.
Closedness Properties in EX-Identification of Recursive Functions
1998
In this paper we investigate in which cases unions of identifiable classes of recursive functions are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them we find such n that 1) if every union of n - 1 classes out of U1;, . . ., Un is identifiable, so is the union of all n classes; 2) there are such classes U1;, . . ., Un-1 that every union of n-2 classes out of them is identifiable, while the union of n - 1 classes is not. We show that by finding these n we can distinguish which requirements put on the iden…
Unions of identifiable families of languages
1996
This paper deals with the satisfiability of requirements put on the identifiability of unions of language families. We consider identification in the limit from a text with bounds on mindchanges and anomalies. We show that, though these identification types are not closed under the set union, some of them still have features that resemble closedness. To formalize this, we generalize the notion of closedness. Then by establishing “how closed” these identification types are we solve the satisfiability problem.
Majority and minority influence, task representation and inductive reasoning
1996
One hundred and fifty-five participants had to solve a set of 2–4–6 like reasoning problems (Wason, 1960), in which they were told which hypothesis a majority (or a minority) proposed, as well as which example was used for the test. In a 2 × 2 design, participants were also told that the problems allowed either one single correct answer or several possible answers. Results show that, when the source is a majority and the problem allows one single answer, most participants adopt the source's hypothesis and use confirmatory testing. On the contrary, it is when the source is a minority and the problem allows several answers that most participants give alternative hypotheses and use disconfirma…
Towards Axiomatic Basis of Inductive Inference
2001
The language for the formulation of the interesting statements is, of course, most important. We use first order predicate logic. Our main achievement in this paper is an axiom system which we believe to be more powerful than any other natural general purpose discovery axiom system. We prove soundness of this axiom system in this paper. Additionally we prove that if we remove some of the requirements used in our axiom system, the system becomes not sound. We characterize the complexity of the quantifier prefix which guaranties provability of a true formula via our system. We prove also that if a true formula contains only monadic predicates, our axiom system is capable to prove this formula…