Suppr超能文献

[通过递归思维解决复杂问题的可能性]

[Possibility of solving complex problems by recursive thinking].

作者信息

Hayashi Hajimu

机构信息

Japan Society for the Promotion of Science/Department of Cognitive Psychology in Education, Graduate School of Education, Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto 606-8501.

出版信息

Shinrigaku Kenkyu. 2002 Jun;73(2):179-85. doi: 10.4992/jjpsy.73.179.

Abstract

This study examined the ability in recursive thinking to solve problems. To think recursively is one of the most effective ways to break up large and complex problems into smaller ones. This study prepared two problems with the same tail recursion: The "Guess-the-Number game" and the "Hat puzzle (Wise men puzzle)." Because participants (N = 35) were not familiar with recursive thinking, they learned how to think recursively in the Guess-the-Number game. Then, we tested whether they could solve the Hat puzzle recursively. The results show that two-thirds of the participants could solve the problem recursively, even if the size of the problem increased. Furthermore, their solution times had differed between correct and incorrect answers. This suggests that the difference reflected a "saving" of effort for problem solving.

摘要

本研究考察了运用递归思维解决问题的能力。进行递归思考是将大型复杂问题分解为较小问题的最有效方法之一。本研究准备了两个具有相同尾递归的问题:“猜数字游戏”和“帽子谜题(智者谜题)”。由于参与者(N = 35)不熟悉递归思维,他们在猜数字游戏中学习了如何进行递归思考。然后,我们测试他们是否能够通过递归方式解决帽子谜题。结果表明,即使问题规模增加,三分之二的参与者能够通过递归方式解决问题。此外,他们正确和错误答案的解决时间有所不同。这表明这种差异反映了在解决问题时“节省”了精力。

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验