Euclid’s Algorithm
Euclid’s algorithm for finding the greatest common divisor of two integers and its partial proof.
Tags
- algorithms 1
- cogs501 1
- cogsci 1
- dictionary 1
- discrete 4
- functional programming 1
- funprog 5
- grammar 1
- i/o 1
- if expression 1
- iteration 3
- lambda 2
- language 5
- linear algebra 1
- lists 2
- number theory 4
- numerical 1
- parsing 1
- plotting 1
- probability 3
- programming 6
- proof 3
- python 6
- recursion 2
- scientific 1
- semantics 1
- sequence 1
- sets 1
- sorting 1
- strings 2
- tuples 2
- typing 1
algorithms
cogs501
Assignment in lambda expressions
We closed the post More state power with a function that collects n random numbers between start and end into a list. Here is the function again:
cogsci
Language primer
Initial steps for cognitive science students interested in language.
dictionary
More state power
State unfied into a single parameter, dictionaries introduced.
discrete
Euclid’s Algorithm
Euclid’s algorithm for finding the greatest common divisor of two integers and its partial proof.
Very basic number theory
Fundamental notions of number theory and proof techniques.
Basic number theory
Mainly proof questions based on basic number theory.
Peano Arithmetic
An introduction to recursion and typing through PA
functional programming
Assignment in lambda expressions
We closed the post More state power with a function that collects n random numbers between start and end into a list. Here is the function again:
funprog
Higher order functions
An introduction to higher-order functions in programming.
The way of lambda
An introduction to lambda expressions in Python and their use in (functional) programming.
Higher-order functions
A set of programming exercises to practice higher-order functions.
funcutils
A utility module for functional abstractions.
A sequence processor
A generic function to process sequences based on user-defined behavior.
grammar
Phrase Structure Grammars
Building phrase structure grammars to generate sentences and analyze their structure.
i/o
Files
Working with files in Python.
if expression
The way of lambda
An introduction to lambda expressions in Python and their use in (functional) programming.
iteration
Euclid’s Algorithm
Euclid’s algorithm for finding the greatest common divisor of two integers and its partial proof.
Iteration by while
An introduction to iteration using while loops in Python, illustrated with the Collatz conjecture.
Iteration
A set of programming exercises to practice iteration.
lambda
Assignment in lambda expressions
We closed the post More state power with a function that collects n random numbers between start and end into a list. Here is the function again:
The way of lambda
An introduction to lambda expressions in Python and their use in (functional) programming.
language
Language primer
Initial steps for cognitive science students interested in language.
Model-theoretic interpretation
A very brief introduction
Phrase Structure Grammars
Building phrase structure grammars to generate sentences and analyze their structure.
Zipf’s Law
Tasks on Zipf’s and related laws.
Tokenization
Various text tokenization techniques in Python.
linear algebra
Linear Algebra
Linear algebra exercises.
lists
More state power
State unfied into a single parameter, dictionaries introduced.
Sequence operations
Exercises on sequence manipulation.
number theory
Euclid’s Algorithm
Euclid’s algorithm for finding the greatest common divisor of two integers and its partial proof.
Very basic number theory
Fundamental notions of number theory and proof techniques.
Basic number theory
Mainly proof questions based on basic number theory.
Peano Arithmetic
An introduction to recursion and typing through PA
numerical
Scientific computing
Modules and techniques for scientific computing in Python.
parsing
Phrase Structure Grammars
Building phrase structure grammars to generate sentences and analyze their structure.
plotting
Plotting
Plotting in Python.
probability
Basic probability
Probability exercises.
Combinatorics
Various counting exercises.
Zipf’s Law
Tasks on Zipf’s and related laws.
programming
Assignment in lambda expressions
We closed the post More state power with a function that collects n random numbers between start and end into a list. Here is the function again:
Higher order functions
An introduction to higher-order functions in programming.
More state power
State unfied into a single parameter, dictionaries introduced.
The power of the state
The notion of state and how to enhance its memory power by tuples.
The way of lambda
An introduction to lambda expressions in Python and their use in (functional) programming.
Iteration
A set of programming exercises to practice iteration.
proof
Euclid’s Algorithm
Euclid’s algorithm for finding the greatest common divisor of two integers and its partial proof.
Very basic number theory
Fundamental notions of number theory and proof techniques.
Basic number theory
Mainly proof questions based on basic number theory.
python
Higher-order functions
A set of programming exercises to practice higher-order functions.
Iteration
A set of programming exercises to practice iteration.
Sequence operations
Exercises on sequence manipulation.
recursion
Basic Recursion
Recursion exercises.
Peano Arithmetic
An introduction to recursion and typing through PA
scientific
Scientific computing
Modules and techniques for scientific computing in Python.
semantics
Model-theoretic interpretation
A very brief introduction
sequence
Sequence operations
Exercises on sequence manipulation.
sets
Sets
Math and programming exercises based on basic set theory.
sorting
Sorting
Sorting in Python.
strings
Strings
String operations in Python.
Tokenization
Various text tokenization techniques in Python.
tuples
The power of the state
The notion of state and how to enhance its memory power by tuples.
Sequence operations
Exercises on sequence manipulation.
typing
Peano Arithmetic
An introduction to recursion and typing through PA