Search Sciweavers | Sciweavers

429 search results - page 16 / 86

» Noisy Turing Machines

click to vote

CATS
2007

70views Applied Computing» more CATS 2007»

Analysis of Busy Beaver Machines via Induction Proofs

13 years 8 months ago

Download crpit.com

The busy beaver problem is to ﬁnd the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this va...

James Harland

claim paper

Read More »

click to vote

LOGCOM
2010

120views more LOGCOM 2010»

Paraconsistent Machines and their Relation to Quantum Computing

13 years 2 months ago

Download www.cle.unicamp.br

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

claim paper

Read More »

click to vote

HRI
2010
ACM

123views Human Computer Interaction» more HRI 2010»

Mysterious machines

14 years 22 days ago

Download www.bartneck.de

—Alan Turing proposed a test for the intelligence of machines in 1950 [1]. Despite great efforts, no computer has passed this test so far. Each year, chat bots compete for the Lo...

Billy Schonenberg, Christoph Bartneck

claim paper

Read More »

click to vote

ENTCS
2011

131views more ENTCS 2011»

Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How

13 years 2 months ago

Download users.ox.ac.uk

We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computation�...

Ed Blakey

claim paper

Read More »

117

click to vote

Book

1569views

Introduction to Logic

15 years 7 months ago

Download www.ii.uib.no

Very well organized and easy to follow book. The table of content can be downloaded from the attachment section below.

Micha l Walicki