Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
LOGCOM
2010
120views more  LOGCOM 2010»
11 years 4 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
CORR
2010
Springer
127views Education» more  CORR 2010»
11 years 7 months ago
On Turing machines, dynamical systems and the Atiyah problem
: We consider mixed Dirichlet-Robin problems on scale irregular domains. In particular, we study the asymptotic convergence of the solutions of elliptic problems with Robin boundar...
Lukasz Grabowski
MSCS
2010
104views more  MSCS 2010»
11 years 8 months ago
A note on accelerated Turing machines
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
Cristian S. Calude, Ludwig Staiger
JCSS
2000
116views more  JCSS 2000»
11 years 9 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
TCS
2008
11 years 9 months ago
Turing machines and bimachines
We associate the iterated block product of a bimachine with a deterministic Turing machine. This allows us to introduce new algebraic notions to study the behavior of the Turing m...
John Rhodes, Pedro V. Silva
ENTCS
2007
153views more  ENTCS 2007»
11 years 9 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
AML
2008
124views more  AML 2008»
11 years 9 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
CDES
2006
84views Hardware» more  CDES 2006»
11 years 11 months ago
Simulation of a Turing Machine using EndoII Splicing Rules
In this paper we define splicing rules for class II restriction endonucleases and show how a Turing Machine can be simulated using such rules.
Kamala Kritihivasan, Anshu Bhatia, T. S. Chandra
JAC
2008
11 years 11 months ago
Sofic one head machines
There are several systems consisting in an object that moves on the plane by following a given rule. It is frequently observed that these systems eventually fall into an unexplaine...
Anahí Gajardo
EUROGP
1999
Springer
141views Optimization» more  EUROGP 1999»
12 years 2 months ago
Busy Beaver - The Influence of Representation
The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962. In this paper we propose an evolutionary approach to this problem. We will focus on the representati...
Penousal Machado, Francisco Baptista Pereira, Am&i...
books