Jiří Wiedermann:

Coupling Computational and Non-Computational Processes- Minimal Artificial Life [ Coupling.pdf  ]
Relativistic Computers and Non-Uniform Complexity Theory [  Relativistic.ps ]
Superturingovský výpočetní potenciál kognitivních a evolučních systémů [  Superturingovsk.pdf ]
Emergence of a Super-Turing Computational potential an Artificial Living Systems [  Emergence.ps ]
Fuzzy Turing Machines Revised [ Fuzzy Turing.ps  ]
Fuzzy Neuroidal Nets and Recurrent Computations [  Fuzzy Neuroidal.ps ]
Beyond the Turing Limit- Evolving Interactive Systems [ Beyond.ps  ]
On the Super-Turing Computational Power of Non-Uniform Families of Neuromata [ On the Super-Turing.ps  ]
Fuzzy Computations are more Powerful than Crisp Ones [ Fuzzy Computations.ps ]
Towards Machines That Can Think [ Towards.ps  ]
Accelerating Nondeterministic Single-Tape Off-Line Computations by One Alternation [ Accelerating.ps  ]
Five New Simulation Results on Turing Machines [ Five.ps  ]
Autopoietic Automata [ Autopoietic.pdf  ]


Zeno machines and hypercomputation [ 0412022-zeno-machines.pdf ]
Petrus H. Potgieter
komentár 


Computation Beyond Turing Machines
Seeking appropriate methods to model computing and human thought.
PAUL WATSON
Peter Wegner and Dina Goldin

Super-Turing Computation: A Case Study Analysis
Keith Douglas
Carnegie Mellon University 2003
komentár 


BEYOND TURING A KNOWLEDGE BASED MODEL RELATIVISTIC C^n MACHINE
A. C. Manohruan and M. Manoharatt
University of Central Oldrthom& E&non& Ok. 73034-0128

Hypercomputation: Hype or Computation?
Can we physically implement a hypercomputer? So far no one has.
Viewpoint Christof Teuscher and Moshe Sipper
August 2002/Vol. 45, No. 8 COMMUNICATIONS OF THE ACM

On The Computational Power Of Neural Nets
Hava T. Siegelmann, Department of Computer Science Rutgers University
New Brunswick, NJ 08903
Eduardo D. Sontag, Department of Mathematical Rutgers University New Brunswick, NJ 08903

An Introduction to post-Newtonian and non-Turing computation.
Mike Stannett (1991, re-released 2000) 1 TR CS-91-02, Dept of Computer Science, Sheffield University, UK. 

Non-Turing Computers and Non-Turing Computability
Mark Hogarth Department of History and Philosophy of Science Free School Lane Cambridge CB2 3RH United Kingdom

PREDICTABILITY, COMPUTABILITY, AND SPACETIME
MARK HOGARTH Sidney Sussex College, Cambridge

Hypercomputation is Experimentally Irrefutable
Mike Stannet Verification and Testing Research Group Dept of Computer Science, Sheffield University, UK

Computation over arbitrary models of time
A unified model of discrete, analog, quantum and hybrid computation 
Mike Stannett Verification and Testing Research Group Dept of Computer Science, Sheffield University, UK

Deciding Arithmetic in Malament-Hogarth Spacetimes
Mark Hogarth Department of History and Philosophy of Science Cambridge

Computing the noncomputable
Tien D Kieu, Centre for Atom Optics and Ultrafast Spectroscopy, Swinburne University of Technology, Hawthorn 3122, Australia

Hypercomputation: computing more than the Turing machine
Toby Ord, Department of Philosophy The University of Melbourne
komentár 


The Diagonal Method and Hypercomputation
Toby Ord and Tien D. Kieu