找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Unconventional Computation; 9th International Co Cristian S. Calude,Masami Hagiya,Jon Timmis Conference proceedings 2010 Springer-Verlag Be

[復(fù)制鏈接]
樓主: 加冕
51#
發(fā)表于 2025-3-30 11:02:09 | 只看該作者
A Computational Journey into Nonlinearityy always in a state of becoming. In the process, some meta-principles emerge which guide the autonomous evolution of mathematical computation. These organic principles are essential keys to analyze very large numerical simulations of unstable phenomena: they lie at the heart of the new theory of Qualitative Computing.
52#
發(fā)表于 2025-3-30 15:17:41 | 只看該作者
53#
發(fā)表于 2025-3-30 17:02:30 | 只看該作者
54#
發(fā)表于 2025-3-30 23:52:42 | 只看該作者
Majority Adder Implementation by Competing Patterns in Life-Like Rule ,2/,2345f patterns — symmetric (.) and asymmetric (.). We construct basic logical gates and elementary arithmetical circuits by simulating logical signals using glider reactions taking place in the channels built of non-destructible still lifes. We design a binary adder of majority gates realised in rule .2/.2345.
55#
發(fā)表于 2025-3-31 01:33:44 | 只看該作者
Quantum Computation with Devices Whose Contents Are Never Readter with a WOM nor a quantum computer without a WOM can solve, when all other resource bounds are equal. We also show that resource-bounded quantum reductions among computational problems are more powerful than their classical counterparts.
56#
發(fā)表于 2025-3-31 06:27:33 | 只看該作者
57#
發(fā)表于 2025-3-31 09:43:44 | 只看該作者
A New Representation of Chaitin Ω Number Based on Compressible Stringsheir properties. In particular, we show that the computability of the real Θ(.) gives a sufficient condition for a real .?∈?(0,1) to be a fixed point on partial randomness, i.e., to satisfy the condition that the compression rate of . equals to ..
58#
發(fā)表于 2025-3-31 16:36:22 | 只看該作者
59#
發(fā)表于 2025-3-31 21:03:45 | 只看該作者
60#
發(fā)表于 2025-3-31 22:46:23 | 只看該作者
The Extended Glider-Eater Machine in the Spiral Rule Since the counter can be understood as a part of the Minsky register machine with only the INC (increment) function implemented, we envisage that the extended glider-eater machine could be essential if one intends to build a complete Minsky register machine in the Spiral Rule and to prove the rule is Turing-universal.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-21 19:07
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
镇赉县| 雷山县| 江门市| 乌什县| 临海市| 望江县| 太康县| 万山特区| 东海县| 郯城县| 孝义市| 宿松县| 突泉县| 吉安市| 禹州市| 敦煌市| 永胜县| 济宁市| 临江市| 鹤岗市| 乌鲁木齐县| 满城县| 景泰县| 刚察县| 丹巴县| 慈利县| 平和县| 乌海市| 越西县| 巫溪县| 灵山县| 嘉祥县| 鲁甸县| 固原市| 增城市| 班玛县| 安福县| 弋阳县| 固始县| 门头沟区| 镇原县|