古老 发表于 2025-3-25 06:46:03

Games, Logic and ComputersToday much of the work once done by human muscle and brains is being delegated to machines, and people in all walkd of life asking: What human abilities are irreplaceble? What can machines not do? It may surprise the reader to learn that, whereas the first question has no definite answer, the second has a straightforward mathematical solution.

insidious 发表于 2025-3-25 10:40:48

http://reply.papertrans.cn/24/2321/232069/232069_22.png

Torrid 发表于 2025-3-25 12:00:29

http://reply.papertrans.cn/24/2321/232069/232069_23.png

SOB 发表于 2025-3-25 18:00:09

0924-5952 Overview: 978-94-010-7561-9978-94-009-2356-0Series ISSN 0924-5952

使高兴 发表于 2025-3-25 21:26:26

https://doi.org/10.1007/978-94-017-3095-2es triangle and observe it. The happy idea of constructing a new line from the top vertex to the base enables us to notice relations between the parts of the new diagram, thereby proving the conclusion. Or, alternatively, we can do this by observing the possibility of a rigid motion in space that interchanges the two base vertices.

evasive 发表于 2025-3-26 01:35:50

Process and Existence in Mathematicses triangle and observe it. The happy idea of constructing a new line from the top vertex to the base enables us to notice relations between the parts of the new diagram, thereby proving the conclusion. Or, alternatively, we can do this by observing the possibility of a rigid motion in space that interchanges the two base vertices.

META 发表于 2025-3-26 07:19:11

Stability problems in analytic continuation,inute questions which were formerly regarded as of small theoretical interest. When the range of actual human computation was narrow, there seemed little point in obtaining faster procedures which were still far beyond what was feasible. Furthermore, on account of the versatility of machines, it now

Ingest 发表于 2025-3-26 09:23:26

http://reply.papertrans.cn/24/2321/232069/232069_28.png

使乳化 发表于 2025-3-26 14:31:10

Convergence of iterates of contractions,always longer or more complex than the premisses, is always decidable when there are finitely many rules only. Thus, given a statement ., the total number of statements which can enter in a proof of . is finite since every rule has a fixed number of premisses.

一起平行 发表于 2025-3-26 18:32:55

http://reply.papertrans.cn/24/2321/232069/232069_30.png
页: 1 2 [3] 4 5 6
查看完整版本: Titlebook: Computation, Logic, Philosophy; A Collection of Essa Hao Wang Book 1990 Science Press, Beijing, China and Kluwer Academic Publishers, Dordr