C. Calude, J. Hromkovic  Home/Search
Context
Related
| cs.auckland.ac.nz/CDM...009handbook.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.auckland.ac.nz/...secondcgi.pl (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper (see the discussion in [51, 58, 70, 126, 127, 120, 121, 130]); in what follows we shall superficially review this topic in connection with the related question: can computers think? (Update)
Active bibliography (related documents): More All
1.1: Set Theory and Physics - Svozil (1995) (Correct)
0.5: An Improved Algorithm for the Membership Problem for.. - Kupferman, Zuhovitzky (2002) (Correct)
0.5: A New Approach to Formal Language Theory by Kolmogorov.. - Li, Vitányi (1995) (Correct)
Similar documents based on text: More All
0.4: Notes on Computational Phonology - Stabler (1999) (Correct)
0.3: Recursively Enumerable Reals and Chaitin Ω Numbers - Calude, Hertling.. (1997) (Correct)
0.3: Chaitin Omega Numbers, Solovay Machines, and Incompleteness - Calude (1999) (Correct)
BibTeX entry: (Update)
@techreport{ calude95complexity,
author = "C. Calude and J. Hromkovic",
title = "Complexity: {A} Language-Theoretic Point of View",
year = "1995",
url = "citeseer.ist.psu.edu/calude95complexity.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
168 Algorithms for quantum computation: discrete logarithms and .. - Shor - 1995
166 Some complexity questions related to distributed computing (context) - Yao - 1981
137 Classical Recursion Theory (context) - Odifreddi - 1989
132 Relationships between nondeterministic and deterministic tap.. (context) - Savitch - 1970
127 with an application to the Entscheidungsproblem (context) - Turing, numbers - 1936
92 Riemann's hypothesis and tests for primality (context) - Miller - 1976
84 The Emperor's New Mind (context) - Penrose - 1989
66 A fast Monte Carlo test for primality (context) - Solovay, Strassen - 1977
61 Embedding one interconnection network in another (context) - Monien, Sudborough - 1990
48 Probabilistic algorithms (context) - Rabin - 1976
45 The Rediscovery of the Mind (context) - Searle - 1992
44 Communication complexity (context) - Papadimitriou, Sipser - 1984
32 Machine models and simulations (context) - Boas - 1990
26 The method of forced enumeration for nondeterministic automa.. (context) - Szelepcsenyi - 1988
25 Computation beyond the Turing limit (context) - Siegelmann - 1995
22 Parallel communicating grammar systems: The regular case (context) - Paun, Santean - 1989
20 Computation and Automata (context) - Salomaa - 1985
19 Philosophy of Mathematics and Natural Science (context) - Weyl - 1949
17 Cornerstones of Undecidability (context) - Rozenberg, Salomaa - 1994
14 Turing Machines with Sublogarithmic Space (context) - Szepietowski - 1994
13 Diagonalization and Self--Reference (context) - Smullyan - 1994
11 Randomness and Undecidability in Physics (context) - Svozil - 1993
8 A Search for the Missing Science of Consciousness (context) - Penrose, the - 1994
8 Quantum computation and complexity theory (context) - Svozil - 1995
8 Quantum computation and complexity theory (context) - Svozil - 1995
6 Infinity and the Mind (context) - Rucker - 1983
4 How to Prove It (context) - Velleman - 1994
4 continuous-time computers: a model of analog computation (context) - Moore - 1995
3 therefore entropy (context) - France, Henaut - 1994
3 is topologically large (context) - Zimand, empty et al. - 1993
2 The physical Church-Turing thesis and physical complexity th.. (context) - Pitowsky - 1990
2 A pumping lemma for deterministic context-free languages (context) - Yu - 1989
2 the power of communication in alternating machines (context) - Slobodova - 1988
2 Tasks and super-tasks (context) - Thomson - 1954
1 Houghton Mi#in Comp (context) - Rucker, Tools - 1987
1 On simultaneous resource bounds (context) - Pipinger - 1979
1 The Dreams of Reason (context) - Pagels - 1989
1 Indiana University Press (context) - Strickland - 1993
1 the Power of Communication Structure for Distributive Genera.. (context) - Pardubska - 1994
1 La Revue Musicale (context) - Xenakis, formelle - 1963
1 computabilism (context) - Wang - 1995
Documents on the same site (http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl): More
On a problem of L. Priese - Tomescu (1996) (Correct)
Computably Presentable Models of Theories with Few Models - Khoussainov, Nies, Shore (1996) (Correct)
Computably Categorical Structures and Expansions by.. - Cholak, Goncharov.. (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC