Главная
Study mode:
on
1
Introduction
2
Connecting symbols to specific domains
3
The Chinese Room Argument CRA
4
The Zero Semantical Commitment Condition
5
The Representationalist Approach
6
The Semi-Representationalist Approach
7
The Non-Representationalist Approach
8
The Praxical Solution to SGP
9
Closing remarks
Description:
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it 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.

Introduction to Symbol Grounding

Neuro Symbolic
Add to list