NEW UNDECIDABILITY PROOF FOR HILBERTS TENTH PROBLEM

被引：0

|

作者：

JABLON, P

机构：

来源：

JOURNAL OF SYMBOLIC LOGIC | 1974年 / 39卷 / 01期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：201 / 202

页数：2

相关论文

共 50 条

[1] HILBERTS TENTH PROBLEM IS UNSOLVABLE
DAVIS, M
[J]. AMERICAN MATHEMATICAL MONTHLY, 1973, 80 (03): : 233 - 269
[2] RIEMANN HYPOTHESIS AND HILBERTS TENTH PROBLEM
不详
[J]. CURRENT SCIENCE, 1965, 34 (14): : 443 - &
[3] HILBERTS TENTH PROBLEM FOR QUADRATIC RINGS
DENEF, J
[J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 48 (01) : 214 - 220
[4] CHOWLA,S - RIEMANN HYPOTHESIS AND HILBERTS TENTH PROBLEM
CARLITZ, L
[J]. AMERICAN MATHEMATICAL MONTHLY, 1966, 73 (08): : 906 - &
[5] CHOWLA S - RIEMANN HYPOTHESIS AND HILBERTS TENTH PROBLEM
MORDELL, LJ
[J]. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY, 1966, 41 (163P): : 567 - &
[6] CHOWLA S - RIEMANN HYPOTHESIS AND HILBERTS TENTH PROBLEM
TIMS, SR
[J]. NATURE, 1966, 211 (5047) : 351 - &
[7] CHOWLA S - RIEMANN HYPOTHESIS AND HILBERTS TENTH PROBLEM
GUINAND, AP
[J]. CANADIAN MATHEMATICAL BULLETIN, 1966, 9 (02): : 258 - &
[8] A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem
Halava, Vesa
Harju, Tero
Sahla, Esa
[J]. FUNDAMENTA INFORMATICAE, 2017, 154 (1-4) : 167 - 176
[9] ON GENERIC UNDECIDABILITY OF HILBERT'S TENTH PROBLEM FOR POLYNOMIAL TREES
Rybalov, A. N.
[J]. PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2019, (44): : 107 - 112
[10] On Turing's proof of the undecidability of the halting problem
Ferreira, U
[J]. MSV'04 & AMCS'04, PROCEEDINGS, 2004, : 519 - 522

← 1 2 3 4 5 →