Copyright B. Buchberger 20031 White-Box / Black-Box Principle etc. Symposium Mathematics and New Technologies: What to Learn, How to Teach? Invited Talk.

Slides:



Advertisements
Similar presentations
Mathematics in Engineering Education 1. The Meaning of Mathematics 2. Why Math Education Have to Be Reformed and How It Can Be Done 3. WebCT: Some Possibilities.
Advertisements

Mathematics in Engineering Education N. Grünwald & V. Konev Hochschule Wismar – University of Technology, Business and Design, Wismar, Germany Tomsk Polytechnic.
Level 1 Recall Recall of a fact, information, or procedure. Level 2 Skill/Concept Use information or conceptual knowledge, two or more steps, etc. Level.
Cooperative Learning NAR Project CfE Level 4 Algebra Mathematics Association 2011 Conference Saturday 17th September 2011 Monica Kirson, Maths Teacher.
Mathematical Induction (cont.)
1 What Is The Future of The Traditional Concept of Mathematical Education – Evolution or Degradation? Outline of The Project of The International Cooperation.
CMSC 104, Version 8/061L04Algorithms1.ppt Algorithms, Part 1 of 3 Topics Definition of an Algorithm Algorithm Examples Syntax versus Semantics Reading.
Software Quality Assurance Inspection by Ross Simmerman Software developers follow a method of software quality assurance and try to eliminate bugs prior.
Calculemus RISC THEOREMA Calculemus at RISC: The THEOREMA Project Bruno Buchberger OVR (“Old Visiting Researcher”) Talk at the Calculemus Midterm Review.
CPSC 411, Fall 2008: Set 12 1 CPSC 411 Design and Analysis of Algorithms Set 12: Undecidability Prof. Jennifer Welch Fall 2008.
“Procedural” is not enough B. Abramovitz, M. Berezina, A. Berman, L. Shvartsman 4 th MEDITERRANEAN CONFERENCE ON MATHEMATICS EDUCATION University of Palermo.
Copyright: Bruno Buchberger “Reading” Working with the Literature Bruno Buchberger Part of the Block Course „Working Techniques“ in the Frame of.
Copyright Bruno Buchberger “Writing” and “Speaking” Written and Oral Presentations Writing Papers and Giving Talks Part of the Block Course „Working.
Copyright Bruno Buchberger Teaching Without Teachers? Bruno Buchberger Research Institute for Symbolic Computation University of Linz, Austria Talk at.
Chapter 3: “Writing” Written Presentations, Writing Papers Copyright Bruno Buchberger 2004 No parts of this file may be copied or stored without written.
Introduction to Software Engineering CS-300 Fall 2005 Supreeth Venkataraman.
Science PCK Workshop March 24, 2013 Dr. Martina Nieswandt UMass Amherst
California Mathematics Council The First Rule of introducing the Common Core to parents: Do MATH with them!
Identify the Problem Identify Criteria And Constraints Brainstorm Solutions Generate Ideas Explore Possibilities Select an Approach Prototype Refine Design.
Science Inquiry Minds-on Hands-on.
Making Clickers Work for You Dr. Stephanie V. Chasteen & Dr. Steven Pollock Workshop developed.
LinearRelationships Jonathan Naka Intro to Algebra Unit Portfolio Presentation.
Ch1 AI: History and Applications Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2011.
GENERAL CONCEPTS OF OOPS INTRODUCTION With rapidly changing world and highly competitive and versatile nature of industry, the operations are becoming.
Knowledge representation
Robert Kaplinsky Melissa Canham
Project MLExAI Machine Learning Experiences in AI Ingrid Russell, University.
Chapter 1: “Reading” Working with the Literature Copyright Bruno Buchberger 2004 No parts of this file may be copied or stored without written permission.
Learning Today Stephanie Fulcer, Kait Stockheimer, Tricia Mace.
Institute for Experimental Physics University of Vienna Institute for Quantum Optics and Quantum Information Austrian Academy of Sciences Undecidability.
TH DERIVE & TI-CAS CONFERENCE 1 'Didactical principles of integrated learning mathematics with CAS' Peter van der Velden, M.Sc. Netherlands.
Formal Models in AGI Research Pei Wang Temple University Philadelphia, USA.
Chapter 1 Defining Social Studies. Chapter 1: Defining Social Studies Thinking Ahead What do you associate with or think of when you hear the words social.
Think about how the world has changed in the last 20 years. What will teaching and learning look like in the next 5, 10, 20+ years?
Introduction to Science Informatics Lecture 1. What Is Science? a dependence on external verification; an expectation of reproducible results; a focus.
Science Fair How To Get Started… (
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
Algorithms, Part 1 of 3 Topics  Definition of an Algorithm  Algorithm Examples  Syntax versus Semantics Reading  Sections
National Math Panel Final report 2008 presented by Stanislaus County Office of Education November 2008.
CSE 311 Foundations of Computing I Lecture 26 Computability: Turing machines, Undecidability of the Halting Problem Spring
CREATING A CLASSROOM COMMUNITY: INQUIRY AND DIALOGUE 2 March 2010.
COMPUTER SCIENCE Computer science (CS) is The systematic study of algorithmic.
1 UMBC CMSC 104, Section Fall 2002 Algorithms, Part 1 of 3 Topics Definition of an Algorithm Algorithm Examples Syntax versus Semantics Reading.
CS 5150 Software Engineering Lecture 22 Reliability 3.
Key Stage 2 SATs Parents’ Meeting Wednesday 4 th March 2015.
Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar Dr Nazir A. Zafar Advanced Algorithms Analysis and Design.
Computing Curriculum Day March 2016 Does this algorithm get Little Red Riding Hood to the Gingerbread Man’s house? Start Finish.
CMSC 104, L041 Algorithms, Part 1 of 3 Topics Definition of an Algorithm Example: The Euclidean Algorithm Syntax versus Semantics Reading Sections 3.1.
Fall 2013 Lecture 27: Turing machines and decidability CSE 311: Foundations of Computing.
“Reading” Working with the Literature
A Design Process Introduction to Engineering Design
Sub-fields of computer science. Sub-fields of computer science.
Algorithms, Part 1 of 3 The First step in the programming process
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
A Design Process Introduction to Engineering Design
Big Ideas & Problem Solving A look at Problem Solving in the Primary Classroom Lindsay McManus.
Unit 1. Sorting and Divide and Conquer
Algorithms I: An Introduction to Algorithms
A Design Process Principles Of Engineering
2008/09/17: Lecture 4 CMSC 104, Section 0101 John Y. Park
The Design Process What Is Design? What Is a Design Process?
A Design Process.
CSCE 411 Design and Analysis of Algorithms
Objective of This Course
A Design Process.
A Design Process Introduction to Engineering Design
Halting Problem.
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Presentation transcript:

Copyright B. Buchberger White-Box / Black-Box Principle etc. Symposium Mathematics and New Technologies: What to Learn, How to Teach? Invited Talk Bruno Buchberger RISC, Kepler University, Linz, Austria Dec 10-11, 2003, Fondación Ramón Areces, Madrid

Copyright B. Buchberger Copyright Note: Copying is allowed under the following conditions: -The paper is kept unchanged. -The copyright note is included. -A brief message is sent to If you use the material, please, cite it appropriately.

Copyright B. Buchberger Contents The “New Technologies” Mathematical Invention: A Spiral Teaching Follows the Invention The White-Box / Black-Box Principle RISC Research: Examples

Copyright B. Buchberger What are the “New Technologies”? Two (completely) different ingredients: –“technologies” like internet, web, graphics, laptops, tabletts etc. –“algorithmic mathematics” This distinction is crucial for discussing “what to learn, how to teach?”

Copyright B. Buchberger “Technologies” They are new. They are (useful) tools for all areas of learning and teaching. These technologies come (in a superficial view) from “outside of mathematics” and are applied to math learning and teaching.  Didactics of using these technologies is basically the same for all areas: Great chance and great challenge but not in the focus of my talk

Copyright B. Buchberger Algorithmic Mathematics is not new and new:

Copyright B. Buchberger Algorithmic Mathematics is not new Since early history, algorithms (“methods”) are the essential goal of mathematics. Algorithms come from within mathematics. Non-trivial algorithms are based on non-trivial theorems (i.e. non-trivial proofs). Math knowledge and math methods are only two sides of the same coin. Non-trivial algorithms trivialize an infinite class of problem instances.

Copyright B. Buchberger The efficiency of mathematical thinking: “Think once deeply and you need not think infinitely many times”. The ultimate goal of mathematics is to trivialize itself. This trivialization is never complete and is “not completable”. (By a version of Gödel’s incompleteness theorem.) The more is trivialized the more difficult (and interesting) it becomes to trivialize more.

Copyright B. Buchberger „Man“ trivialized

Copyright B. Buchberger Algorithmic mathematics is very new. In the past 40 years more algorithms have been invented than in the math history before.

Copyright B. Buchberger “The computer” (i.e. the universal, programmable automaton for executing any algorithm) is new. The computer is a mathematical invention. Its design has been given many years before the first physical realization was done. (Gödel, Turing, von Neumann, etc.) Its principal capabilities and limitations have been exactly clarified many years before the first physical computer was built. The logical design of the computer did not change over the past 60 years whereas its physical realization (the „natureware“) changes with increasing speed. („The computer: a thinking constant.“)

Copyright B. Buchberger The executability of mathematical algorithms by a mathematical machine („the computer“) is new. The execution of math algorithms on the computer, is one of the most exciting examples of application of mathematics to itself. (Self-application is the nature of intelligence and the intelligence of nature.)

Copyright B. Buchberger Executability of math algorithms on math machines have dramatically enhanced the invention capability in (algorithmic) mathematics. Executability of math algorithms on math machines have dramatically enhanced the application capability of mathematics.

Copyright B. Buchberger The “New Technologies” Mathematical Invention: A Spiral Teaching Follows the Invention The White-Box / Black-Box Principle RISC Research: Examples

Copyright B. Buchberger Mathematical Invention: A Spiral The “Creativity Spiral” or “Invention Spiral” B. Buchberger. Mathematics on the Computer: The Next Overtaxation? Didactics-Series of the Austrian Math. Society, Vol.131, March 2000, pp (Used in talks since 1996, Derive Conference, Bonn.)

Copyright B. Buchberger Facts Results ….. Conjecture Insight …. Theorem Knowledge …. Algorithm Method ….

Copyright B. Buchberger A spiral is like a circle: It does not matter where you start. A spiral is more than a circle: Every round goes higher.

Copyright B. Buchberger Facts Results ….. Conjecture Insight …. Theorem Knowledge …. Algorithm Method …. “Seeing” (Observing) “Seeing” (Reasoning, Proving, Deriving, …) Extracting a Method Programming Applying Computing Experimenting

Copyright B. Buchberger Facts Results ….. Conjecture Insight …. Theorem Knowledge …. Algorithm Method …. more better

Copyright B. Buchberger some GCDs ….. GCD[m,n]= GCD[m-n,n] Euclid’s theorem Euclid’s algorithm GCD of large numbers First steps depend only on first digits Lehmer’s theorem Lehmer’s algorithm “better” = more efficient

Copyright B. Buchberger some linear systems triangula- rizable Gauß’ theorem Gauß’ algorithm some non- linear systems reducible to linear tangent systems Newton’s theorem Newton’s algorithm “better” = more general

Copyright B. Buchberger some linear systems triangula- rizable Gauß’ theorem Gauß’ algorithm some non- linear systems linear in the power products Gröbner bases theorem Gröbner bases algorithm “better” = more general

Copyright B. Buchberger some limits limit[f+g]= limit[f]+… limit[f*g] = … limit rules limit algorithm proofs for limit, derivative, … rules reducibility to constraint solving reduction theorem algorithmic prover for elem. analysis “better” = on the meta-level

Copyright B. Buchberger real world problem mathematical model … mathematical knowledge solution method “better” = more applicable Modeling Applying

Copyright B. Buchberger The “New Technologies” Mathematical Invention: A Spiral Teaching Follows the Invention The White-Box / Black-Box Principle RISC Research: Examples

Copyright B. Buchberger Teaching Follows the Invention A (good) way of teaching: follow the path of invention. Allow the students to feel the pressure of an unsolved problem and the excitement of the invention. Don’t avoid all pitfalls and failures: –ideas don’t come from Kami (“God”) –but from Kami (“Paper”). Avoid some pitfalls and failures: Japanese “sensei”: the person who lived earlier. Master and teach all phases and aspects of the invention spiral.

Copyright B. Buchberger The teaching of math in application fields (economy, engineering, medicine etc.) is different: –The application of methods is in the focus. –This is a very important part of math teaching, which of course today profits tremendously from the availability of algorithmic mathematics in the form of “mathematical systems” like Mathematica etc. –The other phases of the spiral, e.g. “proving”, cannot be trained extensively. –This type of teaching is not in the focus of this talk.

Copyright B. Buchberger For “complete math teaching”: –Master and teach all phases and aspects of the invention spiral. –What to teach? This question has not the same importance as the question of teaching the math invention technology. –One can never be complete in terms of “what to teach” but one should be complete in terms of the phases and aspects of the mathematical invention process. –The “what to teach” is the more standardized the younger the students (children) are.

Copyright B. Buchberger Aspects of the invention process: –modeling, representing, … –inventing, analyzing, specifying problems –decomposing into subproblems –retrieving knowledge, check applicability, using existing “technologies” –conjecturing knowledge, inventing methods –arguing, discussing, reasoning, proving, verifying, comparing, generalizing, cooperating, … –programming “in the small and in the large” –assessing programs and systems –documenting, presenting, storing, … –applying, assessing results, … –…

Copyright B. Buchberger –For young children, the phases of the invention process are indistinguishable: “Touch, play, see, and memorize”. –For adults: the efficiency of mathematics stems from the distinction between observing, reasoning, and acting. –Somewhen between the age of 14 and “reasoning” (and then proving) becomes possible. –Mathematics is the art of reasoning for gaining knowledge and solving problems.

Copyright B. Buchberger The “New Technologies” Mathematical Invention: A Spiral Teaching Follows the Invention The White-Box / Black-Box Principle RISC Research: Examples

Copyright B. Buchberger The White-Box / Black-Box Principle When should we apply “technology” in math teaching? (Remember: In this talk, “technology” = algorithms.) Example: Should we teach “integration rules” when we have systems that can “do integrals”? Example: Should we teach “linear systems” when we have systems that can “do linear systems”? Example: Should we teach … when we have systems that can “do …”?

Copyright B. Buchberger B. Buchberger. Should Students Learn Integration Rules? ACM SIGSAM Bulletin Vol.24/1, pp , January (However, introduced already in talk at ICME 1984, Adelaide)

Copyright B. Buchberger When should we apply “technology” in math teaching? The Populists’ Answer: Stop teaching things “the computer” can do! The Purists’ Answer: Ban the computer from math teaching! The White-Box Black-Box Principle: Absolute answer is not possible, Answer depends on the phase of teaching.

Copyright B. Buchberger some linear systems triangula- rizable Gauß’ theorem Gauß’ algorithm The white-box phase of teaching linear systems arith- metics explore the problem reason program

Copyright B. Buchberger Gauß’ algorithm The black-box phase of teaching linear systems = the white-box phase of teaching non- linear systems arith- metics explore the problem and observe prove program some non-linear systems non-linear = linear in the power products Gröbner bases theorem Gröbner bases algorithm

Copyright B. Buchberger explore the problem and observe prove program some geo proofs reducible to ideal membership Rabinowitch theorem Geo theorem proving algorithm The black-box phase of teaching non-linear systems = the white-box phase of teaching geo theorem proving

Copyright B. Buchberger The white-box black-box principle is recursive. You may start at any round in the spiral. The black-box phase is exactly the moment for applying “technology”, i.e. the current math systems. This moment is relative and not absolute. There is nothing like “absolutely necessary” and “absolutely obsolete math content”. There is nothing like “absolutely creative” and “absolutely technical” topics in math.

Copyright B. Buchberger You may want to walk in the reverse direction through the spiral (black-box / white-box). “Program” may also mean “train to apply in examples”.

Copyright B. Buchberger The “New Technologies” Mathematical Invention: A Spiral Teaching Follows the Invention The White-Box / Black-Box Principle RISC Research: Examples

Copyright B. Buchberger From the RISC Kitchen We don’t want to be just users of the technology. We don’t want to be just implementers of the technology. We want to be creators of the technology. See Mathematica Notebook “RISC Research”

Copyright B. Buchberger Conclusion The technology is permanently expanding through the global invention spiral. The algorithmic result of one invention round is tool for the next round. Math teaching should teach the “thinking technology of mathematical invention” in well-chosen white-box / black-box invention rounds whose contents depend on many factors. The contents of mathematics are the accumulated and condensed experience of mankind in gaining knowledge and solving problems by reasoning.