Before 2030, will an AI system be able to solve compositional problems of arbitrary depth?
IAOne-OffTecnología3a
Manifold MarketsSin KYCDatos de resolución verificadosBien calibradoPronóstico comunitario actualNo 53.1%
Pronosticadores
4
Tipo de pregunta
binary
Metodología
Play-money forecasting platform
Tipo de fuente
Pronóstico
Datos de mercado
Actualizado hace 45 minutos
Retrasado7 jun 25, 16:40 UTC31 dic 29, 23:59 UTC
Tendencias
Reglas
Given a problem that requires repeated application of specific rules (such as multiplying two large numbers or solving towers of Hanoi), will any AI system be able to generalize to arbitrarily large compositional depth? A new paper by Apple shows that they cannot currently do this.
- [image]It still counts even if the system shows some performance drop off with increased depth.
- What I'm looking for here is performance that does not drop of exponentially past a certain depth.
- It does not count if the AI system is doing this by writing code.
- Update 2025-06-07 (PST) (AI summary of creator comment): - The AI system is allowed to use a scratch pad or external memory.
