Relevance of Maths for CS John Barnden School of Computer Science University of Birmingham Intro to Maths for CS 2013/14.

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

LIFE CYCLE MODELS FORMAL TRANSFORMATION
1 Undergraduate Curriculum Revision Department of Computer Science February 10, 2010.
Computer Science It’s more than programming Eric Lantz.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Department of Mathematics and Computer Science
What do Computer Scientists and Engineers do? CS101 Regular Lecture, Week 10.
Overview of Computer Vision CS491E/791E. What is Computer Vision? Deals with the development of the theoretical and algorithmic basis by which useful.
MS Computer Science: Dr. William J. Wolfe Professor and Chair Computer Science CSUCI MS Mathematics: Dr. Ivona Grzegorczyk Professor and Chair Mathematics.
Computer Science: An Overview Dr. Christian Skalka.
From Discrete Mathematics to AI applications: A progression path for an undergraduate program in math Abdul Huq Middle East College of Information Technology,
Statistical Methods in Computer Science Why? Ido Dagan.
CS 10051: Introduction to Computer Science What is the course about?
CS 1 – Introduction to Computer Science Introduction to the wonderful world of Dr. T Daniel Tauritz, Ph.D. Associate Professor of Computer Science.
Discrete Structure CS 203 Introduction.
School of Computer ScienceG53FSP Formal Specification1 Dr. Rong Qu Introduction to Formal Specification
Applying Multi-Criteria Optimisation to Develop Cognitive Models Peter Lane University of Hertfordshire Fernand Gobet Brunel University.
Artificial Intelligence
CSE 515 Statistical Methods in Computer Science Instructor: Pedro Domingos.
SKA-cba-ase NSF and Science of Design Avogadro Scale Engineering Center for Bits & Atoms November 18-19, 2003 Kamal Abdali Computing & Communication.
Artificial Intelligence
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
Introduction to Computer and Programming CS-101 Lecture 6 By : Lecturer : Omer Salih Dawood Department of Computer Science College of Arts and Science.
CS 21a: Intro to Computing I Department of Information Systems and Computer Science Ateneo de Manila University.
C OMPUTER S CIENCE, C OMPUTER E NGINEERING, I NFORMATION T ECHNOLOGY AND S YSTEMS, F LOW OF C ONTROL, B ATCH AND I NTERACTIVE P ROCESSING Week 5 Mr. Mohammed.
By: Er. Sukhwinder kaur.  Computation Computation  Algorithm Algorithm  Objectives Objectives  What do we study in Theory of Computation ? What do.
SCI Scientific Inquiry The Big Picture: Science, Technology, Engineering, etc.
THE NEW ERA OF LIFE. Introduction: Artificial Intelligence (AI) is the area of computer science focusing on creating machines that can engage on behaviors.
Structure of Study Programmes
Software Engineering ‘The establishment and use of sound engineering principles (methods) in order to obtain economically software that is reliable and.
Structure of Study Programmes Bachelor of Computer Science Bachelor of Information Technology Master of Computer Science Master of Information Technology.
10/6/2015 1Intelligent Systems and Soft Computing Lecture 0 What is Soft Computing.
© 2007 Pearson Addison-Wesley. All rights reserved 0-1 Spring(2007) Instructor: Qiong Cheng © 2007 Pearson Addison-Wesley. All rights reserved.
Discrete Structures for Computing
 Day 59 Computer Science and Industry Exploring The Intersection Between CS and Other Fields.
The roots of innovation Future and Emerging Technologies (FET) Future and Emerging Technologies (FET) The roots of innovation Proactive initiative on:
What did I take from the research in AMT to the research in Computer Science and Software Engineering Education? Orit Hazzan Department of Education on.
Computer Sciences at NYU Open House January 2004 l Graduate Study at New York University l The MS in Computer Sciences l The MS in Information Systems.
1 CS 2710, ISSP 2610 Foundations of Artificial Intelligence introduction.
I Robot.
Major Disciplines in Computer Science Ken Nguyen Department of Information Technology Clayton State University.
Lecture Comp 25 Math & Logic Discussion. What is logic? Logic is the study of reason Focus is the method or process by which an argument unfolds Aristotle.
Main Topics in Intro to Maths for CS & Textbook Offer John Barnden School of Computer Science University of Birmingham 2014/15.
1 CS 385 Fall 2006 Chapter 1 AI: Early History and Applications.
SOFTWARE DESIGN. INTRODUCTION There are 3 distinct types of activities in design 1.External design 2.Architectural design 3.Detailed design Architectural.
Master’s Degree in Computer Science. Why? Acquire Credentials Learn Skills –Existing software: Unix, languages,... –General software development techniques.
Mathematical Modeling: Intro Patrice Koehl Department of Biological Sciences National University of Singapore
Spring 2016 Graduate Preview November 3, Spring 2016 Graduate Courses CS 532 – Web Science R 4:20-7:00pm Nelson CS 550 – Database Concepts ONLINE.
Fundamentals/ICY: Databases 2013/14 Initial Orientation John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Of 27 12/03/2015 Boole-Shannon: Laws of Communication of Thought 1 Laws of Communication of Thought? Madhu Sudan Harvard.
Introduction to Artificial Intelligence CS 438 Spring 2008.
College of Computer Science, SCU Computer English Lecture 1 Computer Science Yang Ning 1/46.
Copyright © 2015 Pearson Education, Inc. Chapter 0: Introduction.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
CS 1010– Introduction to Computer Science Daniel Tauritz, Ph.D. Associate Professor of Computer Science Director, Natural Computation Laboratory Academic.
CS 2130 Computational Structures (Discrete Mathematics for Computing)
Sub-fields of computer science. Sub-fields of computer science.
Introduction to formal languages and automata
Types for Programs and Proofs
CHAPTER 1 Introduction BIC 3337 EXPERT SYSTEM.
Computer Science Courses
Fundamentals/ICY: Databases 2010/11 WEEK 1
Computer Aided Design and Computer Aided Manufacturing
Big Ideas in Computer Science
Chapter 0: Introduction
CSE 515 Statistical Methods in Computer Science
Fundamentals/ICY: Databases 2012/13 Initial Orientation
Kharkiv National Pedagogical University
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
Computer Science Courses in the Major
Presentation transcript:

Relevance of Maths for CS John Barnden School of Computer Science University of Birmingham Intro to Maths for CS 2013/14

Two Broad Types of Relevance Maths coming from the task performed by a program maths issues raised by CS concepts/techniques themselves

Task-Imposed Mathematics computation to help maths investigation itself, e.g. – testing numbers for primehood – proving mathematical theorems – doing algebraic manipulations – detecting and categorizing mathematical formulas in documents computational science, e.g. – simulation of molecules, galaxies, the weather, … massive statistical calculations in data mining and statistical approaches to natural language understanding, etc.

Task-Imposed Mathematics, contd maths involved in the mechanical, physical, visual and geographical aspects of robotics and computer games Maths involved in recognition and production of facial expressions, gesture, body language, … calculation in general tools, e.g. – statistical calculation in database systems – calculations in word-processing and diagram-drawing software

Task-Imposed Mathematics, contd It's not just that you need mathematical sensitivity to understand the imposed task and program it more reliably and helpfully, but there can be major maths complications in exactly how the task is done – e.g., clever ways of streamlining large scientific calculations.

Maths Issues raised by CS Techniques/Concepts Themselves (there are tastes of all these issues in various modules in this school, some at undergraduate levels and some at master's level) Analysis of the "space complexity" and "time complexity" of algorithms (i.e. programs, basically) – This concerns how much data an algorithm needs to store and how long the algorithm takes, as a function of the "size" of the problem. – This matter is very important for making intelligent choices of algorithms for particular real-world problems. – Even if you don’t yourself work out the formulas, you need to understand them and their significance. [issue introduced in the Foundations module]

Maths Issues raised … (contd) Maths involved in the calculations done by a data-structuring technique, e.g. in "hashing" Maths involved in the core concepts on which modern "relational“ database software is built – the word "relational" alludes to an abstract notion of "relation" that brings in complicated mathematical reasoning. Maths involved in computer security, notably the cryptography involved in securely encrypting documents sent over the internet, incl. in activities like electronic voting.

Maths Issues raised … (contd) Maths involved in the verification of programs - i.e. reliably establishing that a program does what it is meant to do, or uncovering often difficult-to-see cases where it might not. – Especially difficult and important in modern, highly parallel and distributed computing, interfacing with awkward entities such as people! [touched upon in Foundations]

Maths Issues raised … (contd) Maths (incl. pure, statistical and probabilistic, and calculus) involved in the nature of various advanced, non-traditional sorts of computational framework, such as neural networks, evolutionary computing and quantum computing – Neural and evolutionary: these are main types of “natural” or “nature- inspired” computing Relatedly: maths involved in algorithms for automated learning-- "machine learning".

Maths Issues raised … (contd) Maths involved in the general abstract notions of what programs, computers, computation, etc. are. – this includes proofs of what can and cannot be done through computing (e.g. the "Halting Problem") – and proofs about the equivalence or otherwise of different computational frameworks. Relatedly: precise mathematical specifications of the meaning of individual programs. Statistical/probabilistic maths involved in the theory of information and orderedness (cf. "entropy").

Summary: Two Broad Types of Relevance task-imposed maths performed by programs maths issues raised by CS concepts/techniques themselves