“ Algorithmic Mathematics ” and “ Dialectic

نویسنده

  • Peter HENRICI
چکیده

Peter Henrici coined the term “algorithmic mathematics” and “dialectic mathematics” in a 1973 talk. I will borrow these two terms and attempt to synthesize the two aspects from a pedagogical viewpoint with illustrative examples gleaned from mathematical developments in Eastern and Western cultures throughout history. Some examples from my teaching experience in the classroom will also be given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Projected non-stationary simultaneous iterative methods

In this paper, we study Projected non-stationary Simultaneous It-erative Reconstruction Techniques (P-SIRT). Based on algorithmic op-erators, convergence result are adjusted with Opial’s Theorem. The advantages of P-SIRT are demonstrated on examples taken from to-mographic imaging.

متن کامل

Taking the Enemy as Medicine: Dialectic and Therapy in the Work of Two Early Indian Doxographers

This article discusses the function of dialectic in religious history, focusing on the works of two major sixth century Indian intellectuals and doxographers Bhāviveka and Haribhadra Sūri, who belonged to the competing Madhyamaka Buddhist and Jaina traditions respectively. The article studies how these two figures used medical metaphors for their dialectic purposes.

متن کامل

Dialectic constructivism as a Platform for the Realization of Ethics Education

Background: One of the issues in ethics philosophy is what is the criterion of ethics verdict? In other words, among the high school students, what is the criterion for measuring the ethical action of a normal and Unethical action? Ethical education has a certain degree of difficulty and complexity, and it is not very effective regarding the emotional and spiritual aspect of the scientific appr...

متن کامل

Super- and sub-additive transformations of aggregation functions from the point of view of approximation

The way super- and sub-additive transformations of aggregation functions are introduced involve suprema and infima taken over simplexes whose dimensions may grow arbitrarily. Exact values of such transformations may thus be hard to determine in general. In this note we discuss methods of algorithmic approximation of such transformations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002