Verify Your Runs

نویسندگان

  • Klaus Havelund
  • Allen Goldberg
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verifying time complexity of Turing machines

We show that, for all reasonable functions T (n) = o(n log n), we can algorithmically verify whether a given one-tape Turing machine runs in time at most T (n). This is a tight bound on the order of growth for the function T because we prove that, for T (n) ≥ (n+1) and T (n) = Ω(n log n), there exists no algorithm that would verify whether a given one-tape Turing machine runs in time at most T ...

متن کامل

1 9 M ay 2 01 4 Verifying Time Complexity of Deterministic Turing Machines ∗

We show that, for all reasonable functions T (n) = o(n log n), we can algorithmically verify whether a given one-tape Turing machine runs in time at most T (n). This is a tight bound on the order of growth for the function T because we prove that, for T (n) ≥ (n+1) and T (n) = Ω(n log n), there exists no algorithm that would verify whether a given one-tape Turing machine runs in time at most T ...

متن کامل

CAUVIS-IME-USP at TRECVID 2011: instance search

Structured Abstract In this paper, we describe the participation and results of CAUVIS-IME-USP at TRECVID 2011 in instance search pilot task. Briefly, what approach or combination of approaches did you test in each of your submitted runs?  CAUVIS_USP: PHOW descriptor and the bag-of-word approach. What if any significant differences (in terms of what measures) did you find among runs? We submit...

متن کامل

When self-determination runs amok.

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

متن کامل

The early bird catches the worm.

CESA 10 IMC resources have always been popular for summer school activities. Make sure the materials you want to use this summer will be available when you need them by ordering NOW! CESA 10 IMC Staff will:  help you select resources for summer school activities.  schedule resources for you to preview.  reserve resources for your summer use.  provide resources to support your university or ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005