{"resolved":true,"match_type":"uuid","source_type":"original_book","book_id":"7f418071-0fdc-4a5a-a4c5-82dd1979d9c2","title":"人工智能哲学","author":null,"edition":null,"publisher":null,"year":null,"isbn":"7532740544","requested_by":"printed_page","book":{"source_type":"original_book","book_id":"7f418071-0fdc-4a5a-a4c5-82dd1979d9c2","id":"7f418071-0fdc-4a5a-a4c5-82dd1979d9c2","uuid":"7f418071-0fdc-4a5a-a4c5-82dd1979d9c2","title":"人工智能哲学","normalized_title":"人工智能哲学","author":null,"edition":null,"publisher":null,"year":null,"isbn":"7532740544","isbns":["7532740544"],"parsed":true,"ai_readable":true,"document_type":"book","page_count":501,"navigation_url":"https://workshop.closeclaw.top/ai/book/7f418071-0fdc-4a5a-a4c5-82dd1979d9c2","title_url":"https://workshop.closeclaw.top/ai/title/%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD%E5%93%B2%E5%AD%A6","fixed_page_url_template":"https://workshop.closeclaw.top/ai/book/7f418071-0fdc-4a5a-a4c5-82dd1979d9c2/page/{printed_page}","path_api_url_template":"https://workshop.closeclaw.top/api/ai/book/7f418071-0fdc-4a5a-a4c5-82dd1979d9c2/page/{printed_page}","read_url":"https://workshop.closeclaw.top/api/ai/read/7f418071-0fdc-4a5a-a4c5-82dd1979d9c2","page_url":"https://workshop.closeclaw.top/api/ai/books/7f418071-0fdc-4a5a-a4c5-82dd1979d9c2/page","search_url":"https://workshop.closeclaw.top/api/ai/books/7f418071-0fdc-4a5a-a4c5-82dd1979d9c2/search"},"page":{"printed_page":40,"pdf_page":48,"physical_index":48,"physical_index_base":0,"printed_page_status":"recognized","page_sha256":"b35a701406d5efbe56e28e70b7ae449a0c2010762946a5eecfdf950a383a93a7"},"chapter":"人工智能哲学","content":"人工智能哲学\n\n元类别；而这一条件可以转换成：\n\n$$\n\\begin{array} { r l } & { ( E m , \\ n ) ( p ) n ( i , \\ \\Psi ) ( E j ) _ { ! \\cdot } ( x ) m _ { : } \\Psi ( x ) } \\\\ & { \\quad = _ { 0 . \\ V . } \\ \\Psi ( x ) = 1 _ { : } } \\\\ & { \\quad \\Phi _ { i } \\ \\varepsilon \\ \\sigma \\ ( \\ \\Psi , \\ n t + p ) _ { : }  _ { : } ( w ) m ( x ) t - 1 . \\ \\Phi _ { i } ( n ( t + 1 ) } \\\\ & { \\quad \\ + p , n x + p , w ) = \\Phi _ { i } ( n t + p , \\ n x + p , \\ \\dot { w } ) : . } \\\\ & { ( u , \\ \\nu ) ( w ) m . \\ \\Phi _ { i } ( n ( u + 1 ) + p , \\ n u + p , \\ w ) } \\\\ & { \\quad = \\Phi _ { i } ( n ( \\nu + 1 ) + p , \\ n \\nu + p , \\ w ) _ { \\circ } } \\end{array}\n$$\n\n由于篇幅的限制，我们对上述论点的介绍是十分简要的；我们打算在今后出版中扩充它和它的某些内涵。\n\n最后一个定理的条件虽然不详细，但却简单明了；然而它在实际场合应用时，需要对大约 $2 ^ { 2 n }$ 个函数类别，也就是对 $R ( \\{ \\alpha _ { 1 } , \\cdots , \\alpha _ { s } \\} )$ 的各个元进行考察。因为其中每一个都是定理区的一个可能的β，这种结果不可能是清晰分明的。但是我们有可能得到一个S的可实现性的充分条件，这条件应用起来很方便，并且有可能适合于大多数实际用途。这由定理X给出。\n\n定理X\n\n让我们用下面的递归方式定义S中的一组K：\n\n1. 任何 TPE，以及任何自变量已由K 中的元替代的 TPE，都属于 $\\pmb { K }$\n\n2. 如果 $P r _ { 1 } ( z _ { 1 } )$ 是K的一个元，那么 $\\left( z _ { 2 } \\right) z _ { 1 } . P r _ { 1 } \\left( z _ { 2 } \\right) , \\left( E z _ { 2 } \\right) z _ { 1 }$ $P r _ { 1 } ( z _ { 2 } )$ 和 $C _ { m n } ( z _ { 1 } )$ .s 都属于它，式中 $C _ { m n }$ 代表以n 为模与m同余的特性， $m < n$\n\n3. 这组 K 不再有更多的元。\n\n因此K的每个元都是可实现的。\n\n因为如果 $P r _ { 1 } ( z _ { 1 } )$ 是可实现的，而\n\n$$\n\\begin{array} { r l } & { N _ { i } ( z _ { 1 } ) \\mathrel { \\mathop : } \\equiv \\lrcorner P r _ { 1 } ( z _ { 1 } ) \\cdot S N _ { i } ( z _ { 1 } ) } \\\\ & { N _ { i } ( z _ { 1 } ) \\mathrel { \\mathop : } \\equiv \\lrcorner P r _ { 1 } ( z _ { 1 } ) \\vee S N _ { i } ( z _ { 1 } ) } \\end{array}\n$$\n\n40","previous_page":39,"next_page":41}