The main goal of this paper is to compare recursive algorithms such as Turing machines with such super-recursive algorithms as inductive Turing machines. This comparison is made in a general setting of dual complexity measures such as Kolmogorov or algorithmic complexity. To make adequate comparison, we reconsider the standard axiomatic approach to complexity of algorithms. The new approach all...

Symbolic model checkers can construct proofs of properties over highly complex models. However, the results reported by tool when a proof succeeds do not generally provide much insight to user. It is often useful for users have traceability information related proof: which portions were necessary it. This be used diagnose variety modeling problems such as overconstrained axioms and underconstra...

The necessity and importance of teaching pragmatics has come to light by many researchers (e.g. Rose & Kasper, 2001). Due to the consensus over the need to teach pragmatic competence, the main issue now centers on the question of how we should teach this competence in the most effective way. Consistent with this line of research, the present study aimed to investigate the effectiveness of deduc...