Explore the symbol grounding problem (SGP) in this comprehensive 1-hour 13-minute lecture from the Neuro Symbolic channel. Delve into major philosophical results from 1990 to present, starting with an introduction to SGP and its connection to specific domains. Examine the Chinese Room Argument (CRA) and the Zero Semantical Commitment Condition. Investigate three approaches to SGP: Representationalist, Semi-Representationalist, and Non-Representationalist. Conclude with the Praxical Solution to SGP and closing remarks. Gain insights into this exciting area of artificial intelligence and machine learning, bridging symbolic methods and deep learning, as part of the AI course content from Arizona State University.
Overview
Syllabus
Introduction
Connecting symbols to specific domains
The Chinese Room Argument CRA
The Zero Semantical Commitment Condition
The Representationalist Approach
The Semi-Representationalist Approach
The Non-Representationalist Approach
The Praxical Solution to SGP
Closing remarks
Taught by
Neuro Symbolic
