Homepage / Notes / Computer Science / Theoretical Computer Science
Thread-safe code is code that will work even if many threads are executing it simultaneously.
by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
by Steven Skiena
https://en.wikipedia.org/wiki/Stride_of_an_array
https://en.wikipedia.org/wiki/Lambda_calculus Functions in Lambda Calculus only have an arity of 1.
https://learnxinyminutes.com/docs/lambda-calculus/
P=NP…
https://learnxinyminutes.com/docs/asymptotic-notation/
https://www.bigocheatsheet.com/
https://en.wikipedia.org/wiki/Primitive_data_type What are signed vs unsigned integers?
Generics / Parametric Polymorphism
A function using parametric polymorphism would be written with types to be specified later, and then instantiated when needed with types provided as parameters.
by Benjamin C. Pierce
https://www.andres-loeh.de/LambdaPi/LambdaPi.pdf
https://web.cecs.pdx.edu/~mpj/thih/thih.pdf
https://www.microsoft.com/en-us/research/wp-content/uploads/1997/01/henk.pdf
https://www.cl.cam.ac.uk/~nk480/bidir.pdf
https://www.cs.cmu.edu/~rwh/pfpl/
A machine or language is said to be Turing-complete when it can run any computational problem. Most modern languages are Turing-complete as they all implement the basic features (sum, product, if/else…) needed to compute any program possible.