Results 1  10
of
223
doi:10.5402/2012/271878 Research Article AIComplete CAPTCHAs as Zero Knowledge Proofs of Access to an Artificially Intelligent System
"... Copyright © 2012 Roman V. Yampolskiy. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Experts predict that in the next 10 to 100 year ..."
Abstract
 Add to MetaCart
. In this paper, we address the question of safeguarding a discovery which could without hesitation be said to be worth trillions of dollars. Specifically, we propose a method based on the combination of zero knowledge proofs and provably AIcomplete CAPTCHA problems to show that a superintelligent system has
Research in Music
"... It pains me to ask this: what good is content analysis? I’m trained as an engineer, a signal processor, and a content person. I tackle problems in a systematic fashion, often bottomup. When asked a content question, my first instinct is get out my fast Fourier transform (FFT) hammer. The initial suc ..."
Abstract
 Add to MetaCart
songs sung by Billie Holiday and Ella Fitzgerald are like night and day to a jazz lover; yet they are both elevator music to the punk rocker on the streets of London. What does it mean to be similar? Is this an AIcomplete question
A negative answer to a question by Rieffel
, 2001
"... Abstract. In this article, we address one of the questions raised by Marc Rieffel in his collection of questions on deformation quantization. The question is whether the Kgroups remain the same under flabby strict deformation quantizations. By “deforming ” the question slightly, we produce a negati ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
negative answer to the question. In his collection of questions on deformation quantization [8], Marc Rieffel asked the following; “Are the Kgroups of the C ∗algebra completions of the algebras of any flabby strict deformation quantization all isomorphic? ” Up to my knowledge, the question is still open
What’s new about the semantic web? some questions
 ACM SIGIR Forum
, 2004
"... It is not completely clear what the Semantic Web (SW) is meant to be. Statements about it differ or, rather, the interpretations of statements about it differ. The grand view is that the SW is the core model of the way the world is, expressed in a manner that supports reasoning about this world. The ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
It is not completely clear what the Semantic Web (SW) is meant to be. Statements about it differ or, rather, the interpretations of statements about it differ. The grand view is that the SW is the core model of the way the world is, expressed in a manner that supports reasoning about this world
Explorations in Design Space
, 1994
"... . The methodology of AI as the general study of natural and artificial intelligence is outlined, including exploration of designs for a variety of behaving systems, for both scientific and engineering purposes. The `designstance' treats minds as sophisticated selfmonitoring, selfmodifying co ..."
Abstract

Cited by 55 (31 self)
 Add to MetaCart
for an adequate set of descriptive concepts, clarifying various evolutionary questions, and making it possible to understand what goes wrong in various human activities and which remedies might work. This requires studying niches as well as designs. 1 INTRODUCTION Few people appreciate the breadth of AI. Many
Database Researchers: Plumbers or Thinkers?
"... DB researchers have traditionally focused on enginecentered issues such as indexing, query processing, and transactions. Data mining has broadened the community’s viewpoint towards algorithmic and statistical issues. However, DB research has always had a tendency to shy away from seemingly elusive ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
question the traditional skepticism of DB researchers towards “AIcomplete ” problems and the DB community’s reluctance to embark on seemingly nonDBish grand challenges. Big questions that I see as great opportunities also for DB research include: 1) automatic extraction of relational facts from
Chapter A.2 Principal Design Criteria Question 21
, 2003
"... the statement on Page A. 2.34, "Dose rates at the restricted area boundary are selected so that monitoring of radiation exposure to people outside the restricted area is not required. " Completeness and accuracy of information submitted is required by 10 CFR 72. 11. Response to 21 Sectio ..."
Abstract
 Add to MetaCart
the statement on Page A. 2.34, "Dose rates at the restricted area boundary are selected so that monitoring of radiation exposure to people outside the restricted area is not required. " Completeness and accuracy of information submitted is required by 10 CFR 72. 11. Response to 2
A Grouping Principle and Four Applications
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2003
"... AbstractWertheimer's theory suggests a general perception law according to which objects having a quality in common get perceptually grouped. The Helmholtz principle is a quantitative version of this general grouping law. It states that a grouping is perceptually "meaningful" if its ..."
Abstract

Cited by 59 (6 self)
 Add to MetaCart
or is it significant and enough to group O 1 ; . . . ; O k ? In order to answer this question, we make the following mental experiment: we assume a contrario that the considered quality has been randomly and uniformly distributed on all objects, i.e., O 1 ; . . . ; O n . Notice that this quality may be spatial (like
Completeness of the isomorphism problem for separable C*algebras
, 2013
"... We prove that the isomorphism problem for separable nuclear C*algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*algebras is a complete orbit equivalence relation. This means that any isomorphism problem arsing from a cont ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
continuous action of a separable completely metrizable group can be reduced to the isomorphism of simple, separable AI C*algebras. This sheds new light on the classification problem for separable C*algebras, which dates back to the 1960’s. In particular, this answers questions posed by Elliott, Farah
N Pcompleteness of generalized multi Skolem sequences
"... A Skolem sequence is a sequence a1,a2,...,a2n (where ai ∈ A = {1,...,n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The existence question of deciding which sets ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A Skolem sequence is a sequence a1,a2,...,a2n (where ai ∈ A = {1,...,n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The existence question of deciding which sets
Results 1  10
of
223