Search for tag: "informatics"

208 Media

19:10 Advanced Technology for Financial Computing MSc Advanced Technology for Financial Computing MSc	Advanced Technology for Financial Computing MSc Learn more about the Advanced Technology for Financial Computing MSc in this overview presentation from Programme Director, Dr Tiejun Ma. This new programme from the School of Informatics will… school of informatics msc fintech fintech advanced technology for financial computing msc programme students institute opportunities edinburgh technologies degree sector informatics sectors finance risk banking study opportunity events entrepreneurship innovation process language variety From Nicola Hopper on December 1st, 2020 0 likes 0 plays 0 Publisher UoE School of Informatics Licence Type All rights reserved The University of Edinburgh Language English Date Created November 30th, 2020
53:47 CL - 22 - Tseytin Satisfaction DPLL CL - 22 - Tseytin Satisfaction DPLL	CL - 22 - Tseytin Satisfaction DPLL N/A inf1a introduction to computation informatics 1 computation and logic thing things clauses exam clause front karnaugh mistakes pc models cheque zeros gate bit circuit rules slide unit nb piece From Haoran Peng on December 1st, 2020 0 likes 6 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
50:26 CL - 21 - CNF KM Gentzen Tseytin CL - 21 - CNF KM Gentzen Tseytin	CL - 21 - CNF KM Gentzen Tseytin N/A inf1a introduction to computation informatics 1 computation and logic From Haoran Peng on December 1st, 2020 0 likes 5 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
53:56 CL - 20 - syllogisms arrowrule CL - 20 - syllogisms arrowrule	CL - 20 - syllogisms arrowrule N/A inf1a introduction to computation informatics 1 computation and logic things ways syllogisms diagram thing lines rule arrows times side aristotle problem answer valuations satisfies cycle 's assumption questions logic From Haoran Peng on November 30th, 2020 0 likes 17 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
55:01 CL - 18 - rules CL - 18 - rules	CL - 18 - rules This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza.This lecture introduces a very important… inf1a introduction to computation informatics 1 computation and logic rules machine things star friend proof language relation thing string solution theorem rule expression comma languages start sets words sigma From Haoran Peng on November 30th, 2020 0 likes 26 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
37:11 FP - Lecture 19 - Propositions as Types FP - Lecture 19 - Propositions as Types	FP - Lecture 19 - Propositions as Types This is the last FP video lecture, on Propositions as Types. inf1a informatics 1 introduction to computation haskell functional programming types proof b. thing things a. logic term pair function rule rules curry programme lambda idea calculus introduction milner From Claudia-Elena Chirita on November 29th, 2020 0 likes 110 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
54:51 CL - 19 - regex DFA NFA CL - 19 - regex DFA NFA	CL - 19 - regex DFA NFA This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza. inf1a computation and logic informatics 1 From Haoran Peng on November 23rd, 2020 0 likes 198 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
55:01 CL - 17 - regex: Arden's lemma CL - 17 - regex: Arden's lemma	CL - 17 - regex: Arden's lemma This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza. inf1a introduction to computation informatics 1 computation and logic From Haoran Peng on November 23rd, 2020 0 likes 213 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
49:40 CL - 16 - ε-transitions and the subset… CL - 16 - ε-transitions and the subset construction	CL - 16 - ε-transitions and the subset construction This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza. inf1a introduction to computation informatics 1 computation and logic machine epsilon transitions transition epsilons string start dfa table lights numbers machines haskell diagram thing things character hole place picture From Haoran Peng on November 23rd, 2020 0 likes 216 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
02:48 CL - 15f - R* -- Iteration CL - 15f - R* -- Iteration	CL - 15f - R* -- Iteration We construct an NFA for R*; then summarize the algebra of regular expressions. inf1a introduction to computation informatics 1 computation and logic string epsilon expressions things language match thing unit sum matches star expression times concatenation alternation numbers strings names algebra r. From Haoran Peng on November 23rd, 2020 0 likes 220 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
05:47 CL - 15e - RS -- Concatenation CL - 15e - RS -- Concatenation	CL - 15e - RS -- Concatenation We use ε-transitions to connect two NFA and create a machine that recognises the concatenation of their languges. inf1a introduction to computation informatics 1 computation and logic string epsilon machine transitions star start epsilons things idea 's machines s. construction strings characters rules pieces trick bias recognise From Haoran Peng on November 23rd, 2020 0 likes 249 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
02:02 CL - 15d - Using ε-transitions CL - 15d - Using ε-transitions	CL - 15d - Using ε-transitions We present a first example of the use of ε-transitions to concstruct new mahines, and pose a problem to be answered in the following video. inf1a introduction to computation informatics 1 computation and logic epsilon machine star language iteration sequencing epsilons strings symbol string rule moment a. surveys sequence problem languages silo efa recognisable From Haoran Peng on November 23rd, 2020 0 likes 230 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
06:09 CL - 15c - Introducing ε-transitions CL - 15c - Introducing ε-transitions	CL - 15c - Introducing ε-transitions We introduce NFA - automata with ε-transitions inf1a introduction to computation informatics 1 computation and logic machine word words epsilon language mfa machines bits fsm transitions dfa string rule start examples dice trace sets components equivalent From Haoran Peng on November 23rd, 2020 0 likes 259 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
47:13 FP - Lecture 18 - IO and Monads FP - Lecture 18 - IO and Monads	FP - Lecture 18 - IO and Monads This is the second video on the FP lecture on IO and Monads. inf1a informatics 1 introduction to computation functional programming haskell io and monads monads monad things thing string question function a. questions guard lists return idea result computer parser coin character equations b. From Claudia-Elena Chirita on November 23rd, 2020 0 likes 236 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
11:48 CL - 15b - Boolean operations on DFA-Regular… CL - 15b - Boolean operations on DFA-Regular Languages	CL - 15b - Boolean operations on DFA-Regular Languages Since DFA-regular languages are closed under complements and intersections, they are closed under all Boolean operations. inf1a introduction to computation informatics 1 computation and logic machine machines languages language dfa intersection union string arrows light lights row column pair pairs sequence things transitions end construction From Haoran Peng on November 22nd, 2020 0 likes 292 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English
05:34 CL - 15a - Regular Languages (III) : DFA-regular CL - 15a - Regular Languages (III) : DFA-regular	CL - 15a - Regular Languages (III) : DFA-regular Our third definition: we say a language is DFA-regular if it is the language recognised by some DFA.We show that the complement of a DFA-regular language is DFA-regular. inf1a introduction to computation informatics 1 computation and logic machine light language machines transition complement symbols character lights operation sequences transitions alphabet complementation mba sigma remainder automaton dfa table From Haoran Peng on November 22nd, 2020 0 likes 331 plays 0 Course Code INFR08025 Licence Type All rights reserved The University of Edinburgh Language English

Search for tag: "informatics"

the university of edinburgh