🔬

On the falsifiability of hypercomputation, part 2: finite input streams

📅 2020
technical research breakthrough
⚪ Common
#falsifiability

📖 Description

In [part 1](https://unstableontology.com/2020/02/07/on-the-falsifiability-of-hypercomputation/), I discussed the falsifiability of hypercomputation in a *typed* setting where putative oracles may be assumed to return natural numbers. In this setting, there are very powerful forms of hypercomputation (at least as powerful as each level in the [Arithmetic hierarchy](https://en.wikipedia.org/wiki/Arithmetical_hierarchy)) that are falsifiable.

📊 Game Impacts

Variable Change Condition
Research +15 Always
Vibey Doom +2 Always
Ethics Risk -5 Always

💭 Reactions

🔬 Safety Researcher Reaction: ⚠️ Placeholder - Needs Real Quote
"Adds to our knowledge base"
📰 Media Reaction: ⚠️ Placeholder - Needs Real Quote
"Discussed in AI safety community"
💡 Found a Real Quote? Suggest it here

🔗 Sources

🏷️ Event Metadata

Think this event's metadata could be improved? Suggest changes to category, rarity, tags, game impacts, or p(doom) effects.

📁 Category Technical Research Breakthrough → Suggest different category
⭐ Rarity ⚪ Common → Suggest different rarity
🏷️ Tags (1) falsifiability → Suggest tag changes
📊 Game Impacts (3) 3 variable changes → Suggest impact changes
☢️ p(Doom) Impact No direct impact → Suggest p(doom) change
📝 General Metadata Year, description, reactions → Comprehensive review

🤝 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)
← Back to All Events