Topics Top articles New articles Updated articles Top users New users New discussions Top discussions New comments+ New article
Early transmitters such as the spark-gap transmitter could only send noises to send Morse code.
To send voice and music, amplitude modulation had to be developed. And a key ingredient of this is the carrier wave.
The problem is, the carrier wave needs to have somewhat high frequencies, in the hundreds of kHz TODO why. But as you might imagine, that is hard to achieve by mechanical means such as a hand cranck like Hippolyte Pixiis alternator!
Interestingly, some of the first carrier wave generators were actually mechanical, e.g. the Alexanderson alternator.
But clearly such mechanical machines were not very scalable, and soon more electronic devices were introduced, notably the vacuum tube.
The first type of device that allowed sending Morse code without wires, as opposed to the wired electrical telegraph that previously existed.
Naval communications was one of the first major applications, as you can't have wires on boats!
Wireless voice transmission came about with modulation.
A member of the underlying field of a vector space. E.g. in , the underlying field is , and a scalar is a member of , i.e. a real number.
Experiments to measure it:
The 2019 redefinition of the SI base units defines it precisely and uses it as a measure of charge: en.wikipedia.org/wiki/2019_redefinition_of_the_SI_base_units#Ampere
Quantum is getting hot in 2019, and even Ciro Santilli got a bit excited: quantum computing could be the next big thing.
No useful algorithm has been economically accelerated by quantum yet as of 2019, only useless ones, but the bets are on, big time.
To get a feeling of this, just have a look at the insane number of startups that are already developing quantum algorithms for hardware that doesn't/barely exists! quantumcomputingreport.com/players/privatestartup (archive). Some feared we might be in a bubble: Are we in a quantum computing bubble?
To get a basic idea of what programming a quantum computer looks like start by reading: Section "Quantum computing is just matrix multiplication".
Some people have their doubts, and that is not unreasonable, it might truly not work out. We could be on the verge of an AI winter of quantum computing. But Ciro Santilli feels that it is genuinely impossible to tell as of 2020 if something will work out or not. We really just have to try it out and see. There must have been skeptics before every single next big thing.
Course plan:
- Section "Programmer's model of quantum computers"
- look at a Qiskit hello world
- e.g. ours: qiskit/hello.py
- learn about quantum circuits.
- tensor product in quantum computing
- First we learn some quantum logic gates. This shows an alternative, and extremely important view of a quantum computer besides a matrix multiplication: as a circuit. Fundamental subsections:
- quantum algorithms
Quantum computers are not expected to solve NP-complete problems by Ciro Santilli 35 Updated 2025-01-06 +Created 1970-01-01
Only NP-intermediate, which includes notably integer factorization:
- quantumcomputing.stackexchange.com/questions/16506/can-quantum-computer-solve-np-complete-problems
- www.cs.virginia.edu/~robins/The_Limits_of_Quantum_Computers.pdf by Scott Aaronson
- cs.stackexchange.com/questions/130470/can-quantum-computing-help-solve-np-complete-problems
- www.quora.com/How-can-quantum-computing-help-to-solve-NP-hard-problems
Quantum algorithm for linear systems of equations by Ciro Santilli 35 Updated 2025-01-06 +Created 1970-01-01
History of the University of Oxford by Ciro Santilli 35 Updated 2025-01-06 +Created 1970-01-01
This book series appears to be the one: global.oup.com/academic/content/series/h/history-of-the-university-of-oxford-huo/. A mere 250 pounds+ each.
We will get into more detail later, but it is good to have it in mind now:
- section: exists before linking, in object files.One ore more sections will be put inside a single segment by the linker.Major information sections contain for the linker: is this section:
- raw data to be loaded into memory, e.g.
.data
,.text
, etc. - or metadata about other sections, that will be used by the linker, but disappear at runtime e.g.
.symtab
,.srttab
,.rela.text
- raw data to be loaded into memory, e.g.
- segment: exists after linking, in the executable file.Contains information about how each segment should be loaded into memory by the OS, notably location and permissions.
Toy/test/tought experiment algorithm.
How many logical qubits are needed to run Shor's algorithm? by Ciro Santilli 35 Updated 2025-01-06 +Created 1970-01-01
News aggregators:
Personal websites:
This section is about companies that integrate parts and software from various other companies to make up fully working computer systems.
General Game Playing (Stanford project) by Ciro Santilli 35 Updated 2025-01-06 +Created 1970-01-01
This kind of died at some point checked as of 2023.
Pinned article: ourbigbook/introduction-to-the-ourbigbook-project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
- Internal cross file references done right:
- Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact