复杂性科学视野中的还原论问题 |
| |
引用本文: | 张本祥,颜泽贤.复杂性科学视野中的还原论问题[J].复杂系统与复杂性科学,2005,2(3):79-83. |
| |
作者姓名: | 张本祥 颜泽贤 |
| |
作者单位: | 华南师范大学系统科学与系统管理研究中心,广州,510631 |
| |
摘 要: | 还原论问题是哲学界及科学界激烈争论的问题,本文尝试沿着科学进路在特定视角下分析该问题.在把“不可还原“理解为“有新特性且此特性不可预知“的意义上,于复杂性科学视野中存在着一个考察还原论问题的标度阶梯:线性、非线性、不可计算性,每一个视角下都有其相应的可还原性和不可还原性.可见,复杂性科学进路中可还原与否是依赖于考察问题的视角的.
|
关 键 词: | 线性 非线性 不可计算性 还原论问题 |
文章编号: | 1672-3813(2005)03-0079-05 |
修稿时间: | 2005年6月5日 |
Reductionism Problem in the View of the Science of Complexity |
| |
Authors: | ZHANG Ben-xiang YAN Ze-xian |
| |
Abstract: | Philosophers and scientists have controverted about reductionism problem for long time.In this paper we attempt to investigate this problem from some special aspects by the approach of science.We perceive unreduction as that there are some new characters and those can not be forecasted.Then in the view of the science of complexity,there is a scale hierarchy to study Reductionism,that is composed of linear,nonlinear and uncomputability,every criterion has its own reduction and unreduction.Hence the science of complexity is helping us to know that reduction or unreduction is dependent on the view to study. |
| |
Keywords: | linear nonlinear uncomplexity reductionism problem |
本文献已被 CNKI 维普 万方数据 等数据库收录! |