期刊文献+

关于双射函数f:N×N×N→N的研究 被引量:1

Study on Bijective Function f:N×N×N→N
下载PDF
导出
摘要 讨论了可数无穷个可数无穷集合的并的计算问题。通过对自然数集合N的二次笛卡尔积运算———N×N和三次笛卡尔积运算———N×N×N的详细分析,得出了它们与自然数集合N之间都存在双射关系结论,即集合N×N和集合N×N×N都是可数无穷的。文中推导出了自然数集合N的三次笛卡尔积运算———N×N×N与自然数集合N之间的双射函数运算公式,对可数无穷集合的复杂计算作了进一步研究。得出结论:任意可数无穷个可数无穷集合的并(如N×N×N×…,即Nn)也是可数无穷的。 Discusses the computational problem about union of countable infinite of countably infinite sets. Through the analysis of the second power Cartesian product of natural number set N——N×N and the thirdpower Cartesian product of natural number set N——N×N×N,obtains the conclusion that they all have the bijective relation to natural number set N,it means that the set N×N and the set N×N×N are all countably infinite.Deduces the operational formula of the function between the third power Cartesian product of the natural number set N——N×N×N and N,and further researches into complex computation of countably infinite sets. In the end it points out that the union of countable infinite of countably infinite sets ( such as N×N×N×…, that is Nn) is also a countably infinite set.
作者 许精明
出处 《微机发展》 2003年第10期102-103,106,共3页 Microcomputer Development
关键词 集合论 自然数集合 可数无穷集合 双射函数 笛卡尔积 三次笛卡尔积运算 bijective function Cartesian product natural number set N countably infinite set
  • 相关文献

参考文献2

  • 1LewisHR PapadimitriouCH 张立昂 刘田译.计算理论基础(第2版)[M].北京:清华大学出版社,2000..
  • 2Lewis H R Papadimitriou C H.张立昂 刘田译.计算理论基础(第2版)[M].北京:清华大学出版社,2000..

同被引文献6

  • 1Richard C; Sttresh P. Bounded Queries and the NP Machine Hypothesis[ C/OL] In Proceedings of Twenty - Second Annual IEEE Con/erenee on Computational Complexity (COC' 07). San Diego, CA, 2007:52 - 59. http://ieeexplore. ieee. org/xpl/RecentCon: jsp? ptmumber = 4262736.
  • 2Collins P, Lygeros J. Computability of finite - time reachable sets for hybrid systems[C/OL]. In Proceedings of 44th IEEE Conference on Decision and Control,2005 and 2005 European Control Conference ( CDC - ECC' 05 ). 2005 : 4688 - 4693. http://ieeexplore, ieee. org/xpl/RecentCon, jsp? punumber = 10559.
  • 3(Mabro C, Impagliazzo R, Paturi R. A duality between clause width and clause density for SAT [ C/OL ]. Twenty - Hrst Annual IEEE Conference on Computational Complexity, 2006 (CCC 2006 ). 2006 : 7. http.//ieeexplore, ieee. org/xpl/ Recentcon. jsp? punumber = 11039.
  • 4Lewis H R, Papadimitriou C H. Elements of the Theory of Computation[M]. Second Edition. Beijing: Tsinghua University Press, 1999.
  • 5Enderton H B. Elements of Set Theory[ M].英文版.Beijing:Posts&Telecom Press,2006.
  • 6Michalewicz Z,Fogel D B.如何求解问题--现代启发式方法[M].曹宏庆等译.北京:中国水利出版社.2003.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部