NDLI: Applying Occam's razor to FSMs

Content Provider	IEEE Xplore Digital Library
Author	Nunez, M. Rodriguez, I. Rubio, F.
Copyright Year	2004
Description	Author affiliation: Dept. Sistemas Informaticos y Programacion, Univ. Complutense de Madrid, Spain (Nunez, M.; Rodriguez, I.; Rubio, F.)
Abstract	In this paper we present a formal learning algorithm based both on the Occam's razor and on Chomsky's classification of languages. Since Chomsky proposes that the generation of language (and, indirectly, any mental process) can be expressed through a kind of formal language, we assume that cognitive processes can be formulated by means of the formalisms that can express those languages. We apply this idea to the simplest languages according to Chomsky's classification, the regular languages, which can be expressed by finite state machines. Besides, we apply the Occam's razor principle, which says that when data do not allow to distinguish between two theories, the simplest one should be chosen. This principle, basic in science, is implicitly applied in the human brain. We apply these concepts to construct an algorithm that provides the simplest finite state machine (that is, the simplest cognitive theory) that fits into some given world observation. Thus, the resulting machine is the most preferable theory for the observer, according to the Occam's razor criterion.
Starting Page	138
Ending Page	147
File Size	485686
Page Count	10
File Format	PDF
ISBN	0769521908
DOI	10.1109/COGINF.2004.1327469
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-08-17
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Humans Cognitive informatics Automata Formal languages Computer science Artificial intelligence Biological neural networks Artificial neural networks
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Grounding Occam's Razor in a Formal Theory of Simplicity

Do deep neural networks have an inbuilt Occam's razor?

Genetic Algorithm for the Weight Maximization Problem on Weighted Automata

Property Inference for Deep Neural Networks

Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks

Neuron mechanism of human languages

Simultaneous verses successive learning in neural networks

Occam's razor is insufficient to infer the preferences of irrational agents

Artificial general intelligence and classical neural network

Applying Occam's razor to FSMs

Similar Documents

Grounding Occam's Razor in a Formal Theory of Simplicity

Do deep neural networks have an inbuilt Occam's razor?

Genetic Algorithm for the Weight Maximization Problem on Weighted Automata

Property Inference for Deep Neural Networks

Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks

Neuron mechanism of human languages

Simultaneous verses successive learning in neural networks

Occam's razor is insufficient to infer the preferences of irrational agents

Artificial general intelligence and classical neural network

Applying Occam's razor to FSMs