Three determinants of difficulty in verbal arithmetic problems
β Scribed by Pearla Nesher
- Publisher
- Springer
- Year
- 1976
- Tongue
- English
- Weight
- 871 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0013-1954
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Let βΈ be the set of GΓΆdel numbers Gn(__f__) of function symbols __f__ such that PRA β’ and let Ξ³ be the function such that We prove: (1) The r. e. set βΈ is mβcomplete; (2) the function Ξ³ is not primitive recursive in any class of functions {__f__~1~, __f__~2~, β} so long as each __f~i~
We studied the factors which determine the difficulty of practice problems in a computer language textbook. These problems have special features, which are that the amount of knowledge required to solve a problem is large and there is more than one way to find the solution. Moreover, if we give the