Stack Exchange Network

Stack Exchange network consists of 180 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange
Loading…
    • Tour Start here for a quick overview of the site
    • Help Center Detailed answers to any questions you might have
    • Meta Discuss the workings and policies of this site
    • About Us Learn more about Stack Overflow the company
    • Business Learn more about our products
  1. current community

    • Computer Science
      help chat
    • Computer Science Meta

    your communities

    Sign up or log in to customize your list.

    more stack exchange communities

    company blog
  2. Log in
  3. Sign up
Results from the 2022 Developer Survey are now available
Computer Science
  1. Home
    1. Public
    2. Questions
    3. Tags
    4. Users
    5. Companies
    6. Unanswered
    1. Teams
      Stack Overflow for Teams – Start collaborating and sharing organizational knowledge. Create a free Team Why Teams?
    2. Teams
    3. Create free Team

Teams

Q&A for work

Connect and share knowledge within a single location that is structured and easy to search.

Learn more
user avatar
user avatar
user avatar
Greg Peckory
  • Member for 6 years, 6 months
  • Last seen more than a month ago
  • GregLand, USA
  • Network profile
Profile Activity
  • Summary
  • Answers
  • Questions
  • Tags
  • Badges
  • Bookmarks
  • Bounties
  • Reputation
  • All actions

6 Questions

Score Activity Newest Views
5 votes
0 answers
54 views

The evolution of the term "recursive" from Goedel to Church to present day

computability recursion church-turing-thesis primitive-recursion
asked May 21, 2018 at 13:04
5 votes
1 answer
235 views

Analogy between Gödel's incompleteness proof and Richard's argument

undecidability proof-techniques mathematical-foundations incompleteness
asked Feb 10, 2018 at 18:06
2 votes
1 answer
236 views

Prove that the Kolmogorov complexity function cannot be approached from below

computability computation-models information-theory kolmogorov-complexity
asked Mar 25, 2016 at 21:22
4 votes
1 answer
3k views

Show that the Halting problem is reducible to its complement

turing-machines reductions halting-problem
asked Mar 7, 2016 at 13:06
2 votes
1 answer
1k views

Check whether loop invariants are correct?

correctness-proof loop-invariants hoare-logic software-verification
asked Dec 9, 2015 at 21:02
1 vote
1 answer
122 views

Show that the following construction is not a correct proof for Context Free Grammars

formal-languages context-free formal-grammars
asked Dec 7, 2015 at 13:49
Computer Science
  • Tour
  • Help
  • Chat
  • Contact
  • Feedback
Company
  • Stack Overflow
  • Teams
  • Advertising
  • Collectives
  • Talent
  • About
  • Press
  • Legal
  • Privacy Policy
  • Terms of Service
  • Cookie Settings
  • Cookie Policy
Stack Exchange Network
  • Technology
  • Culture & recreation
  • Life & arts
  • Science
  • Professional
  • Business
  • API
  • Data
  • Blog
  • Facebook
  • Twitter
  • LinkedIn
  • Instagram

Site design / logo © 2022 Stack Exchange Inc; user contributions licensed under cc by-sa. rev 2022.6.28.42464

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.