Yesterday, a student at Reddit asked me a suitable source to learn elements of set theory which can help him for pure maths. I suggested him two textbooks that I have used over and again in the last 10 years. If you work in TCS, you may like his text on computability theory.

"The Computability of Consciousness" by Mike Stone @MikeStone972 from his twelfth book of poetry (a work-in-progress), "little gods and plausible souls". To read over his shoulder while he writes, click on #poems #poetry #LittleGodsAndPlausibleSouls

The open logic project strikes again with this incredible book on incompleteness and computability, which might be my favorite introduction for beginners to some of the work of Godel and recursion (computability) theory. If you already know first order logic, you're ready!

––Charlie Barnett: "Consciousness and the computability of it. It sounds like, or at least in the past, that you've implied that consciousness is computable. Some, like Roger Penrose, have argued the opposite, and he's argued that consciousness is non-computational, and he uses

Another classic is '' a programming approach to computability'' which starts the study of computability via ''the language of while programs, a lean subset of Pascal'' and covers the classic Turing Machines and μ-recursive function later on in the book. Also, what a cover!😂

Non Computability != AGI or Super Intelligence

MIT's "Automata, Computability, and Complexity".by Prof. Scott Aaronson. Lecture notes: (audio generated by NotebookLM)

The classic text ''Computability and unsolvability'' by Davis released in 1958, is still to this day a great reference and a great way to learn computability theory, a more advanced part of the theory of computation, which central to computer science

Here's an intro and a proof study of Rice's theorem, a very important result in computability theory, which is ''based on a reduction of the halting problem''. Link in the comments

it's never too late to learn about regular expressions, automata, and computability

Algorithmic information theory roots the concept of information in computation rather than in probability. This lecture series offers a journey from the foundations of computability theory to prefix complexity and the limits of formal systems.

computability

WHAT WE HAVE ACHIEVED:.We eliminated discretion by formalizing truth as a warranty against deception, making it testable, insurable, and computable. In Summary:.Producing computability in language was hard because:.- Language was evolved for cooperation, not computation. -.

Quantum computing, potentially the pinnacle of human computability, is largely built on top of Python frameworks. That means that when I want to speed up my C++ code I might have to call a Python function

The incomplete nature, mathematics, computability, physics, biology, being, thinking, process, reality;. Why theory of everything is a categorical error and doomed;. Why ants defy the fallacy of Superintelligence and Simulation Hypothesis. My fav example:.

(Open Access) Incompleteness and Computability: An Open Introduction to Gödel's Theorems - Look for "Read and Download Links" section to download. Follow me if you like this post. #godel #turing #Incompleteness #Computability #logic #math #Mathematics

🔐 Three essential properties for encrypted smart contracts:.1️⃣ Confidentiality.2️⃣ Integrity .3️⃣ Computability .@SeismicSys . #Web3 #ZK #Crypto

You can also get yourself this great little text on computability, unsolvability and Randomness, by Simpson, available on Pen University's website. It's got a great set of chapters on the basics but also Kolmogorov complexity, randomness and more. 🔗in comments

2/5. To better understand Anoma, I will compare it with two of the closest projects: Aleo and DarkFi. Aleo is the best choice for those who want to create private smart contracts with full computability and data protection. DarkFi is focused on anonymous organizations, voting,