发帖
雷达卡
摘要翻译：
乔治·布洛斯提出的“有史以来最难的逻辑难题”成为哲学家和逻辑学家的目标，他们试图修改它，使其更加困难。我建议进一步修改原来的难题，其中部分可用的信息被消除，但解决方案仍然是可能的。该解决方案还提供了关于未知语言发现背后的逻辑的有趣想法。
---
英文标题：
《The hardest logic puzzle ever becomes even tougher》
---
作者：
Nikolay Novozhilov
---
最新提交年份：
2012
---
分类信息：
一级分类：Mathematics 数学
二级分类：Logic 逻辑
分类描述：Logic, set theory, point-set topology, formal mathematics
逻辑，集合论，点集拓扑，形式数学
--
一级分类：Computer Science 计算机科学
二级分类：Artificial Intelligence 人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--
---
英文摘要：
"The hardest logic puzzle ever" presented by George Boolos became a target for philosophers and logicians who tried to modify it and make it even tougher. I propose further modification of the original puzzle where part of the available information is eliminated but the solution is still possible. The solution also gives interesting ideas on logic behind discovery of unknown language.
---
PDF链接：
https://arxiv.org/pdf/1206.1926
京公网安备 11010802022788号
