Edition 4 Hello 👋 here. Welcome to Edition 4 🔮 Near Future 🗽 New York Tenants Fight As Landlords Embrace Facial Recognition Cameras In a bid to stop facial recongition replacing traditional keys, 130 tenants have signed a petition. The public sector heavily regulates facial recognition, but there are currently no laws in the private
Edition 5 Hello 👋 here. 🌊 Welcome to the fifth edition of 🔮Technologically Clairvoyant🔮 This edition is a little long. Lots of things have happened (Libra, + the 2-week break from posting about news)! I’ve reduced it to as short as it can be, I hope you don’t mind!!! 😁 Without further ado, let’
Libra Technical side of Libra Some things about this crypto: * It is pseudo-anonymous (there is no identity on the blockchain) * It’s permissioned (like hyper ledger) Organisations will run nodes. These nodes validate transactions. Each time a consensus is voted on, a new leader will be designated at random to count
Edition 6 Hello 👋 here. 🌊 Welcome to the sixth edition of 🔮Technologically Clairvoyant🔮 Without further ado, let’s get into it 🎪 Near future 🖲 Nimses - Most Addictive Social Network This social network pays you to use it. Every new post you create is more money for you. The more engagement your post gets,
Edition 7 Hello 👋 here. 🌊 Welcome to the seventh edition of 🔮Technologically Clairvoyant🔮 We’re now verified on Brave Browser [or will be in 24 hours]. If you don’t know what Brave Browser is, click here. (affiliate link. I get $5 and it costs you absolutely nothing if you use this). If
Edition 8 Hello 👋 here. Hope you’ve all had an amazing week last week 😁 Without further ado, let’s get right into it 🎪 Near Future 🌑 Designing Lunar Habitats The same company that designed and engineering the Burj Khalifa, the worlds tallest building, is designing a moon base. In collaboration with the European
Farms of the Future Hello 👋 here. Welcome to a special edition ✨ of Technologically Clairvoyant🔮 In this special, we’re going to look at farms 👨🌾👩🌾 The format is the same. We start off with some near future news. But, this time, we dive right into the distant, distant future. Using what we’ve learned from
Big Omega Big Omega Whereas Big O measures the upper bound (the maximum amount of time something can take) Big Omega (using the symbol Ω) measures the best running time. We say that $f(n)$ is $Ω(g(n))$ if there are real constants c and $n_0$ such that: $$f(n)
A Primer on Search Algorithms “It’s written, ‘seek and ye shall find’. But first, ‘imagine what you seek’. Otherwise, you will end up searching everything everywhere forever.” Toba Beta, My Ancestor Was an Ancient Astronaut This article will be a primer on search algorithms used in Artificial Intelligence. This article was formed from lecture
Weekly Thoughts Hey! This is a new newsletter I am trialing. Basically, with previous newsletters I had to stick to a certain topic. Which sucks. I obsess over new things all the time. Soooo…. This newsletter is just a mish-mash of things I think about, and things I learn. Enjoy! :) An Algorithm
Algorithmic Design Paradigms Greedy Algorithms Greedy algorithms aim to make the optimal choice at that given moment. Each step it chooses the optimal choice, without knowing the future. It attempts to find the globally optimal way to solve the entire problem using this method. Why Are Greedy Algorithms Called Greedy? Algorithms are called
Popular Creating your own VPN with PiHole & UnBound on AWS Introduction In this blog post we will: * Create our own VPN on AWS * Add PiHole to iit * Use Unbound as our DNS resolver * Access the VPN using Wireguard * Not go bankrupt doing it! Step 1 Create an AWS lightsail instance on Amazon. We use Lightsail instead of EC2 because EC
Extremely Hard TryHackMe Rooms This is a community created path of extremely difficult rooms that will challenge you. While TryHackMe focuses on learning, the experts need to learn to and that requires much harder content. Enjoy! If you manage to complete this entire list, please message the Discord about it – it’s very hard!
grind75 21. Merge Two Sorted Lists Problem You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list. Example 1: Input: list1
AI Absolute Fundamentals of Artificial Intelligence Machine learning, what a buzzword. I’m sure you all want to understand machine learning, and that’s what I’m going to teach in this article. I found that learning the theroetical side alongside the programming side makes it easier to learn both, so this article features both easy
grind75 Grind75-2 - Valid Parathesis Problem Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: 1. Open brackets must be closed by the same type of brackets. 2. Open brackets
Is the Real Mona Lisa in the Louvre? The most famous painting in the world, more people know her face than perhaps any other face on earth. Presidents, dictators, musicans come and go but her.... she stays put. Her sfumato style elicits many secrets. Is she really a self-portrait of Da Vinci? Is she a play on gender,
Algorithms Featured 🤔 What Is Dynamic Programming With Python Examples Dynamic programming is breaking down a problem into smaller sub-problems, solving each sub-problem and storing the solutions to each of these sub-problems in an array (or similar data structure) so each sub-problem is only calculated once. It is both a mathematical optimisation method and a computer programming method. Optimisation problems
rust Tip: Use match statements instead of hash maps Hashmaps are often touted as the fastest way to store & lookup data. They have O(1) constant time lookup, which means no matter what you look up it will always take the same amount of time. Whereas other search algorithms (Binary Search, for instance) take O(log n) time,
Zero Power Computing — How to Perform Calculations Using Zero Power Moore’s law is dying. There have been countless articles on this. We cannot keep on packing transistors into a given unit of space, expecting each time that the power of the CPU doubles every year. The smaller and smaller the chips are made, the more problems that are produced.
web3 Featured In Response to My first impressions of web3 This a response to Moxie Marlinspike’s “My First Impression of Web3” Both gave me a feeling for how the space works. To be clear, there is nothing particularly “distributed” about the apps themselves: they’re just normal react websites. The “distributedness” refers to where the state and the logic/
programming An Algorithm for Finding Anagrams Finding anagrams of words does not look like a difficult problem but has an interesting solution. An anagram is a word or sentence that can be transformed into another word or sentence. Elvis has all the same letters as Lives, so Elvis is an anagram of Lives. The way most
Who needs painkillers when you have virtual reality? Introduction Image of Blain Baxter from here 10-year-old Blaine Baxter injured his arm in a go-karting accident last year. Painful daily dressing changes at the hospital made him so anxious he had to be sedated. Not only was the sedation costing money, but Blaine was still anxious before the sedation.
Finding The Most Important Sentences Using NLP and TF-IDF We’re going to create a summary of BBC News Articles and place them at the top using a Firefox extension. This article is about the gnarly algorithm Term Frequency-Inverse Document Frequency (TF-IDF). We’re going to create a real-world usage in the form of a Firefox extension. I know
AVL Trees - Trees that can keep balanced by rotating An AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree. Before we delve into AVL trees, we need to learn a few things. Height of a tree The height of a tree is the length of the longest path from the root node (the top