首页> 外国专利> CHURCH-TURING THESIS: THE TURING IMMORTALITY PROBLEM SOLVED WITH A DYNAMIC REGISTER MACHINE

CHURCH-TURING THESIS: THE TURING IMMORTALITY PROBLEM SOLVED WITH A DYNAMIC REGISTER MACHINE

机译:课堂论文:动态注册机解决的课程不完全问题

摘要

A new computing machine and new methods of executing and solving heretofore unknown computational problems are presented here. The computing system demonstrated here can be implemented with a program composed of instructions such that instructions may be added or removed while the instructions are being executed. The computing machine is called a Dynamic Register Machine. The methods demonstrated apply to new hardware and software technology. The new machine and methods enable advances in machine learning, new and more powerful programming languages, and more powerful and flexible compilers and interpreters.
机译:这里介绍了一种新的计算机以及执行和解决迄今为止未知的计算问题的新方法。此处演示的计算系统可以用由指令组成的程序实现,以便可以在执行指令时添加或删除指令。该计算机器称为动态注册器。演示的方法适用于新的硬件和软件技术。新的机器和方法使机器学习,新的和更强大的编程语言以及更强大和灵活的编译器和解释器得到了发展。

著录项

  • 公开/公告号US2011066833A1

    专利类型

  • 公开/公告日2011-03-17

    原文格式PDF

  • 申请/专利权人 MICHAEL STEPHEN FISKE;

    申请/专利号US20090499749

  • 发明设计人 MICHAEL STEPHEN FISKE;

    申请日2009-09-14

  • 分类号G06F9/30;G06F7/00;

  • 国家 US

  • 入库时间 2022-08-21 18:13:16

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号