找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Unconventional Models of Computation; Third International Cristian Calude,Michael J. Dinneen,F. Peper Conference proceedings 2002 Springer

[復(fù)制鏈接]
樓主: hexagon
41#
發(fā)表于 2025-3-28 18:01:11 | 只看該作者
42#
發(fā)表于 2025-3-28 19:16:16 | 只看該作者
Data Structure as Topological Spacesary computations along this path. This idea underlies an experimental declarative programming language called .. . introduces the notion of .: a set of values organized by a neighborhood relationship. The basic computation step in . relies on the notion of .: a path . is substituted for a path . in
43#
發(fā)表于 2025-3-29 00:57:30 | 只看該作者
44#
發(fā)表于 2025-3-29 04:27:23 | 只看該作者
Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Amber of its configuration is conserved through- out its computing process. It can be thought as a kind of modelization of the physical conservation law of mass or energy. Although NCCAs with simple rules are studied widely, it is quite difficult to design NCCAs with complex transition rules. We show
45#
發(fā)表于 2025-3-29 07:49:05 | 只看該作者
Generation of Diophantine Sets by Computing P Systems with External Outputder composition and iteration of functions. We prove that every diophantine set can be generated by such P systems; then, the universality of this model can be deduced from the theorem by Matiyasevich, Robinson, Davis and Putnam in which they establish that every recursively enumerable set is a diop
46#
發(fā)表于 2025-3-29 14:19:13 | 只看該作者
47#
發(fā)表于 2025-3-29 17:28:13 | 只看該作者
Communication and Computation by Quantum Gamescision without knowing the decision of the opponent. Prisoners tell their jailer as their arbitrator their decisions and the jailer gives each of the prisoners an appropriate payoff according to the pay- off function (the payoff table). That is, a certain communication between the two prisoners is p
48#
發(fā)表于 2025-3-29 22:50:38 | 只看該作者
On the Power of Tissue P Systems Working in the Minimal Modems working in the minimal mode. All the results in this paper are solutions to some of the open problems listed in [.] with respect to . systems working in the minimal mode. We obtain two characterizations of recursively enumerable languages: . systems having 2 cells and 3 states as well as . system
49#
發(fā)表于 2025-3-30 03:33:34 | 只看該作者
50#
發(fā)表于 2025-3-30 04:56:40 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-21 01:30
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
利川市| 忻州市| 留坝县| 盈江县| 安康市| 泊头市| 三江| 新河县| 綦江县| 甘肃省| 焉耆| 安岳县| 西吉县| 怀安县| 吉首市| 翁牛特旗| 渝北区| 德州市| 永德县| 慈利县| 桐柏县| 封开县| 香港| 邓州市| 吕梁市| 南雄市| 依兰县| 巫溪县| 岑巩县| 精河县| 孙吴县| 浏阳市| 东兴市| 江陵县| 澄迈县| 安宁市| 唐河县| 隆德县| 东明县| 昭通市| 留坝县|