https://en.wikipedia.org/wiki/Set_builder_notation
https://en.wikipedia.org/wiki/Intuitionistic_logic
| """ | |
| Code also discussed in the video | |
| https://youtu.be/icrXmYHnU9E | |
| Related: | |
| https://en.wikipedia.org/wiki/Mediant_(mathematics) | |
| """ | |
| from fractions import Fraction |
| import time | |
| from virtual_machine import VirtualMachine, approx_rational | |
| def make_update_step(gradient, step_size): | |
| def update_step(state): | |
| g = state['g'] | |
| state['prev_g'] = g |
| class VirtualMachine: | |
| def __init__(self, update_step, max_num_updates=0, halting_condition=lambda state: False): | |
| self.update_step = update_step | |
| self.halting_condition = halting_condition | |
| self.max_num_updates = max_num_updates | |
| self.num_updates = 0 | |
| def run(self, state): |
| # This is a modified version of the python implementation found on | |
| # https://rosettacode.org/wiki/Gaussian_elimination#Python | |
| # | |
| # NOTE: I observe the rosettacode code has a bug for other dimensions of B than in the example (some index error) | |
| import copy | |
| from fractions import Fraction | |
| def gauss_rosettacode(a, b): |
| """ | |
| https://en.wikipedia.org/wiki/Modus_ponens | |
| https://en.wikipedia.org/wiki/De_Morgan%27s_laws | |
| https://en.wikipedia.org/wiki/Double-negation_translation | |
| https://en.wikipedia.org/wiki/Brouwer%E2%80%93Heyting%E2%80%93Kolmogorov_interpretation | |
| https://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspondence | |
| https://en.wikipedia.org/wiki/Exponential_object | |
| https://en.wikipedia.org/wiki/Constructive_analysis | |
| """ |
| """ | |
| Implementation discussed here: | |
| https://youtu.be/mkQ1G6OAuMA | |
| class VirtualMachine: | |
| def __init__(self, update_step, max_num_updates=0, halting_condition=lambda state: False): | |
| self.update_step = update_step | |
| self.max_num_updates = max_num_updates | |
| self.halting_condition = halting_condition |
| """ | |
| Bit level SHA2. | |
| Script to perform sha2 in terms of if-statements and for-loops. This runs 1 batch iteration | |
| (i.e. about 50 bytes max input, but should be easy to extend to any size.) | |
| No warranty. | |
| Explanation video: | |
| https://youtu.be/UziK-Hqzwi4 | |
| 2019 |
Those are the text used in the video
For any finite sets x, we have that |P(x)| > |x|. In particular |{{}}| = |P({})| > |{}|. This is, in terms of Neumann ordinals, 1 > 0. When we say "function" in this text, we always
| % This is the LaTeX file with all the formulas shown in the video on the | |
| % infamous -1/12 value in analytic number theory and other fields: | |
| % | |
| % https://youtu.be/az2WOnxsLhc | |
| \newpage | |
| $\lim_{q \to 1} n\, q^n = n$ | |
| \hspace{.5cm} |