/explore
|
You are here 
|
unenumerated.blogspot.com | ||
| | | | |
www.greaterwrong.com
|
|
| | | | | The most common formalizations of Occam's Razor, Solomonoff induction and Minimum Description Length, measure the program size of a computation used in a hypothesis, but don't measure the running time or space requirements of the computation. What if this makes a mind vulnerable to finite forms of Pascal's Wager? A compactly specified wager can grow in size much faster than it grows in complexity. The utility of a Turing machine can grow much faster than its prior probability shrinks. | |
| | | | |
simulation-argument.com
|
|
| | | | | The original paper that introduced the simulation argument | |
| | | | |
windowsontheory.org
|
|
| | | | | [Yet another "philosophizing" post, but one with some actual numbers. See also this follow up. --Boaz] Recently there have been many debates on "artificial general intelligence" (AGI) and whether or not we are close to achieving it by scaling up our current AI systems. In this post, I'd like to make this debate a bit... | |
| | | | |
www.jamesserra.com
|
|
| | | [AI summary] This technical blog post explains the concepts behind LLMs and Generative AI, details their architecture, and guides developers on using Azure and Microsoft Copilot Studio to apply these models to enterprise data via RAG techniques. | ||
