Debates / Socratic Method for Formal Science Karl Lieberherr.

Slides:

Advertisements

Similar presentations

Giving Feedback. The right and the wrong. >> giving feedback

Advertisements

BRITTANY’S TAKE AWAY. DIFFERENTIATED INSTRUCTION  Is for all students  Make sure to let parents know how the classroom may be run  Allow for time to.

Decision-Making in Small Groups  Group decisions are usually better than individual ones, but this depends on several factors, including the type of.

Hamiltonian Circuits and Paths

EGR 141 Computer Problem Solving in Engineering and Computer Science

AE1APS Algorithmic Problem Solving John Drake.  Invariants – Chapter 2  River Crossing – Chapter 3  Logic Puzzles – Chapter 5  Matchstick Games -

Behavioral Issues in Online Courses. Learning Outcomes In this session, you will: Participate in group activities and offer suggestions for managing a.

Tutorial 6 of CSCI2110 Bipartite Matching Tutor: Zhou Hong ( 周宏 )

TRADING – DEEPER EXPLORATIONS Rajeev Shukla. A word about simplicity.

Tengyu MaXiaoming SunHuacheng Yu Institute for Interdisciplinary Information Sciences Tsinghua University Institute for Advanced Study, Tsinghua University.

Excursions in Modern Mathematics Sixth Edition

Social Choice Session 20 Carmen Pasca and John Hey.

Climate Change: Whose Truth? To what extent do you agree with the following statements?

Online Graph Avoidance Games in Random Graphs Reto Spöhel Diploma Thesis Supervisors: Martin Marciniszyn, Angelika Steger.

Frugal Path Mechanisms by Aaron Archer and Eva Tardos Presented by Ron Lavi at the seminar: “Topics on the border of CS, Game theory, and Economics” CS.

How to prepare better essays? What is an essay?  “Essay” comes from the Latin word –  “exagium” which means  the presentation of a case !!

Poster Design & Printing by Genigraphics ® The Scientific Community Game Education and Innovation Through Survival in a Virtual World of.

The ABCs of Creating Your Own “Online Day”. What is an Online Day? Students remain at home Students remain at home Teachers prepare online assignments.

Mathematics Notebook The Notebook will be a 3-ring notebook! No exceptions.

Formal Two Party Debates about Algorithmic Claims or How to Improve and Check your Homework Solutions Karl Lieberherr.

The Scientific Community Game for STEM Innovation and Education (STEM: Science, Technology, Engineering and Mathematics) Karl Lieberherr Ahmed Abdelmeged.

Teach Better, Do More, Have More Fun, Spend Less Time Suzanna K. Moran, Denver Law Presented at the 15 th Annual Rocky Mountain Legal Writing Conference,

Debates / Socratic Method for Computational Problems Karl Lieberherr Based on Ahmed Abdelmeged’s Dissertation 10/15/20151.

No Losers Affordable Price Unlimited Income Multiple Winners.

Teacher Mentoring for Teacher Leaders August 19, 2011 Office of Professional and Organizational Development Howard County Public Schools 1.

Game-playing AIs Part 1 CIS 391 Fall CSE Intro to AI 2 Games: Outline of Unit Part I (this set of slides)  Motivation  Game Trees  Evaluation.

 Social Media for Public Interaction. Major Questions  How is the public sector using social media?  Analyzing individual users  How are people discussing.

Monash.edu Providing feedback with SETU Student Evaluation of Teaching and Units (SETU)

ABET Assessment One Department’s Experience Paul H. Schimpf penguin.ewu.edu/~pschimpf Eastern Washington University Assessment Colloquium April 26, 2013.

Mathematics ThinkLink Benchmark Assessment What is the data telling us?

Scouting, Statistics and Game Management. Module Outline Bench and Game Management Scouting Statistics.

© K.E. Homa 2000 Case Style Interviews Ken Homa Presentation is incomplete without extensive oral elaboration.

March 7,  School  Courses taught  Interest in this topic  A time when you defended a claim with evidence and reasoning.

The Algorithms we use to learn about Algorithms Karl Lieberherr Ahmed Abdelmeged 3/16/20111Open House 2011.

Social Science Inquiry Model An investigation that follows a formal procedure.

Key Points Karl Lieberherr. Challenge: old high-level description Price Set of problems 1/5/20162Summary.

Solve by Factoring Zero Product Property.

Reflection & Response Blue Sky Focus Group.

Homework - hints Problem 1. Node weights  Edge weights

HCT I.  A goal can be defined as a desired result or purpose toward which one is working  What are some of your goals. Please come up to the board and.

Editorial writing Where your opinion matters. What is an editorial? An article that states the writer’s stance on a particular issue A persuasive essay.

Introduction to Debating. What Is Debating? A debate is when two teams present opposite sides of an issue before judges.

Computer Science Controlled Assessment Mark Clarkson

Intro. ANN & Fuzzy Systems Lecture 20 Clustering (1)

Managing Quality & Risk Week 6 – 15 October Quality Monitoring and Controlling Processes Module leader – Tim Rose.

Introduction to Debates CS5800 Algorithms Instructor: Karl Lieberherr Teaching Assistant: Zhengxing Chen Based on Ahmed Abdelmeged’s Dissertation.

PHI 103 ASH Courses For more course tutorials visit Get Ready to grant success at exam by shop at uoptutorial.

Using Technology-Mediated Feedback to Support Student Success Dr. Rosemary Cleveland – GVSU Faculty College of Education

Intel ® Teach Program Copyright © 2010 Intel Corporation. All rights reserved. Intel, the Intel logo, Intel Education Initiative and Intel Teach Program.

PHI 103 PAPERS E XCELLENCE I N S TUDY PHI 103 Entire Course FOR MORE CLASSES VISIT PHI 103 Week 1 DQ 1 (Consider an argument you.

7 Things to Remember About Feedback

Tweet us one basic math warm-up question you might use, using #TalkLessAM Welcome to Day 2! Chris Luzniak &

Plotting a line graph in Science

Debate Terminology.

Managing Conflict in Relationships

Cycle of Continuous Improvement for

PHI 103Competitive Success/snaptutorial.com

PHI 103 Education for Service-- snaptutorial.com

Re-imagining your programming processes

Reasoning about Reasoning

Social Science Inquiry Model

Debates / Socratic Method for Computational Problems

Hamiltonian Circuits and Paths

FOR TEACHERS Monday – Focus on exposing students to vocabulary, getting definitions, and practicing Tuesday – Slip or Trip activity to begin practicing.

Using feedback to inform planning

Advocating through Social Media

(forces) Day 2 science.

The School Certificate in Philosophy

This is a quick game to quiz two teams of students.

Presentation transcript:

Debates / Socratic Method for Formal Science Karl Lieberherr

Merit Graph different sides Mike:FSusie:V or Mike:FSusie:V Mike-Susie: 0-1 Susie offers learning opportunity to Mike Susie teaches Mike tie impossible Mike-Susie: 1-0 fixed claim c source not forced target wins teaches source debate Merit graph only shows debates where winner has merit.

same sides Both Mike and Susie want to be verifiers. One student becomes devil’s advocate. possibilities: – Mike:forced loses against Susie:non-forced – Mike:forced wins against Susie:non-forced – Mike:non-forced loses against Susie:forced – Mike:non-forced wins against Susie:forced Mike:VSusie:V red does not count because loser is forced. source not forced target wins

Merit Graph same sides Mike:VSusie:V or Mike:VSusie:V Mike-Susie: 0-1 Mike-Susie: 1-0 fixed claim c Mike:VSusie:V Mike-Susie: 1-0 Mike-Susie: 0-1 or Mike:VSusie:V source not forced target wins

Regular Debate Graph same sides Mike:VSusie:V Mike-Susie: 0-1 Mike-Susie: 1-0 fixed claim c source is forced target wins source not forced target wins Red edges are in regular debate graph but not in merit graph. Merit graph only shows debates where winner has merit.

Why Merit Graph Allows us to quickly find meritorious students by looking at debate outcomes. – Find students with minimal number of outgoing edges. Students assign each other merit without involving teaching staff (which must define the claim to be debated. Claim is about current learning module).

Properties of Merit Graph Perfect student has outdegree 0. If there is a debate between two students taking opposite sides, there will be an edge in the merit graph.

Merit Graph for Claim c Gaurav:F Kunal:F Cong:V perfect Possible scenario: Gaurav and Kunal have misunderstood claim c and they think it is false. Cong wins a debate with both of them applying the winning strategy she found for c. Kunal and Gaurav have two debates, one of which Gaurav wins while Kunal is in non-forced position, which indicates that Gaurav has a somewhat better understanding. But still, he took the wrong side F falsifier V verifier Edge: source loses in non-forced position to target. x: counts outgoing edges.

Counting wins does not find meritorious students Gaurav:F Kunal:F Cong:V 2/1 1/4 0/3 Brandon:F 2/0 blue: counting wins x: counts outgoing edges Mike:F 2/0 Denial of Truth Attack Gaurav is not the perfect student Other students helped him to distort the truth Zach:F 1/0

Conclusions Technology to engage students in giving feedback to each other and grading each other. Grading mistakes are impossible. Suitable for online debates in large online classes.