ELK Computational Complexity: Three Levels of Difficulty
📖 Description
[ELK is described](https://www.lesswrong.com/tag/eliciting-latent-knowledge-elk) as a problem we wish to solve in the "worst case"; IE, for any potential failure case we can describe, we want to have a strong argument about why we won't run into that particular problem. The [ELK documen](https://www.lesswrong.com/posts/qHCDysDnvhteW7kRd/arc-s-first-technical-report-eliciting-latent-knowledge)t lists several cases we want to handle in that way. First in this list is the case where **the correct translation is arbitrarily computationally complex**.
📊 Game Impacts
| Variable | Change | Condition |
|---|---|---|
| Research | +10 | Always |
💭 Reactions
🔬 Safety Researcher Reaction:
⚠️ Placeholder - Needs Real Quote
"Provides general AI context"
"Provides general AI context"
📰 Media Reaction:
⚠️ Placeholder - Needs Real Quote
"Discussed in AI safety community"
💡 Found a Real Quote? Suggest it here
"Discussed in AI safety community"
🤝 Found an Issue?
This event data is sourced from the pdoom-data repository. If you notice errors or want to suggest improvements:
GitHub Issue (Preferred) 📧 Email (No GitHub)