◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

C. Feinstein

11 papers hereh-index 7239 citations41 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author11

Across the 11 of 11 papers where every author was matched, so the position is known.

fields
  • cs.CC5
  • math.GM3
  • cs.GL1
  • cs.OH1
  • math.AP1
same name
  • C. Feinstein — 15 papers, h 11
  • C. Feinstein — 3 papers, h 31
  • C. Feinstein — 2 papers, h 1
  • C. Feinstein — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20032016
most citedComplexity Science for Simpletons

5 citations · 15 across the 11 of their papers we have counts for

collaborators
Showing math.GMShow all

3 papers · 1 filter

math.GM2003★ 4 cited

The Collatz 3n+1 Conjecture is Unprovable

Craig Alan Feinstein

In this paper, we show that any proof of the Collatz 3n+1 Conjecture must have an infinite number of lines; therefore, no formal proof is possible.

math.GM2003

The Riemann Hypothesis is Unprovable

Craig Alan Feinstein

In this note, we give a simple proof that the Riemann Hypothesis is unprovable in any reasonable axiom system.

math.GM2003

Is it possible to compute the Moebius function without factoring?

Craig Alan Feinstein

It has been well known since Fermat's Little Theorem was first published that it is possible to determine that a number is composite without determining any of its nontrivial facto…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.