找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Machines, Computations, and Universality; 7th International Co Jerome Durand-Lose,Benedek Nagy Conference proceedings 2015 Springer Interna

[复制链接]
楼主: Wilson
发表于 2025-3-28 16:42:20 | 显示全部楼层
发表于 2025-3-28 20:43:07 | 显示全部楼层
Universality of Graph-controlled Leftist Insertion-deletion Systems with Two Statessymbol at a time. We start by introducing extended rules, in which the contexts may be specified as regular expressions, instead of fixed words. We then prove that leftist systems with such extended rules and two-state graph control can simulate any arbitrary 2-tag system. Finally, we show how our c
发表于 2025-3-29 02:40:55 | 显示全部楼层
发表于 2025-3-29 03:36:52 | 显示全部楼层
发表于 2025-3-29 08:37:57 | 显示全部楼层
An Intrinsically Universal Family of Causal Graph Dynamics time-steps, with respect to two physics-like symmetries: causality (there exists a bounded speed of information propagation) and shift-invariance (the rewriting acts everywhere the same). Intrinsic universality is the ability of the instance of a model to simulate all other instances, while preserv
发表于 2025-3-29 11:50:30 | 显示全部楼层
发表于 2025-3-29 17:37:17 | 显示全部楼层
发表于 2025-3-29 20:20:09 | 显示全部楼层
Universality in Infinite Petri Nets expanding traversals of the cell array. One net is obtained via direct simulation of the cellular automaton while the other net simulates a Turing machine, which simulates the cellular automaton. They use cell models of 21 and 14 nodes, respectively, and simulate the cellular automaton in polynomia
发表于 2025-3-30 02:19:40 | 显示全部楼层
发表于 2025-3-30 05:55:13 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 19:18
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表