The society of mind
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Structural complexity 1
Complexity theory and interaction
A half-century survey on The Universal Turing Machine
Computational learning theory: survey and selected bibliography
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the impact of forgetting on learning machines
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On the inductive inference of recursive real-valued functions
Theoretical Computer Science - Special issue on computability and complexity in analysis
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
How we know what technology can do
Communications of the ACM
Neural Networks: A Comprehensive Foundation
Neural Networks: A Comprehensive Foundation
Introduction to Languages and the Theory of Computation
Introduction to Languages and the Theory of Computation
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
New Perspectives on Computer Concepts: Brief
New Perspectives on Computer Concepts: Brief
Zeno machines and hypercomputation
Theoretical Computer Science
AI, granular computing, and automata with structured memory
DNCOCO'09 Proceedings of the 8th WSEAS international conference on Data networks, communications, computers
Soft computing techniques in ensemble precipitation nowcast
Applied Soft Computing
| Hi-index | 0.00 |
This paper extends traditional models of machine learning beyond their one-level structure by introducing previously obtained problem knowledge into the algorithm or automaton involved. Some authors studied more advanced than traditional models that utilize some kind of predetermined knowledge, having a two-level structure. However, even in this case, the model has not reflected the source and inherited properties of predetermined knowledge. In society, knowledge is often transmitted from previous generations. The aim of this paper is to construct and study algorithmic models of learning processes that utilize predetermined or prior knowledge. The models use recursive, subrecursive, and super-recursive algorithms. Predetermined knowledge includes: a text description, activity rules (e.g., for cognition), and specific structured personal or social memory. Algorithmic models represent these three forms as separate structured processing systems: automata with (1) advice; (2) structured program; and (3) structured memory. That yields three basic models for learning systems: polynomially bounded turing machines, Turing machines, and inductive Turing machines of the first order.